/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 INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 18:46:45,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 18:46:45,382 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 18:46:45,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 18:46:45,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 18:46:45,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 18:46:45,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 18:46:45,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 18:46:45,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 18:46:45,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 18:46:45,422 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 18:46:45,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 18:46:45,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 18:46:45,423 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 18:46:45,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 18:46:45,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 18:46:45,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 18:46:45,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 18:46:45,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 18:46:45,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 18:46:45,425 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 18:46:45,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 18:46:45,426 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 18:46:45,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 18:46:45,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 18:46:45,427 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 18:46:45,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 18:46:45,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 18:46:45,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 18:46:45,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 18:46:45,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 18:46:45,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 18:46:45,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 18:46:45,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 18:46:45,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 18:46:45,430 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 -> INSUFFICIENT_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 18:46:45,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 18:46:45,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 18:46:45,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 18:46:45,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 18:46:45,756 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 18:46:45,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-25 18:46:46,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 18:46:47,134 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 18:46:47,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-25 18:46:47,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e43a8a/65549eacd42f429bbd72bb1d1bb4fb0b/FLAGebd8b3f90 [2023-08-25 18:46:47,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8e43a8a/65549eacd42f429bbd72bb1d1bb4fb0b [2023-08-25 18:46:47,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 18:46:47,156 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 18:46:47,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 18:46:47,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 18:46:47,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 18:46:47,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3374e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47, skipping insertion in model container [2023-08-25 18:46:47,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,179 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 18:46:47,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 18:46:47,354 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 18:46:47,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 18:46:47,416 INFO L206 MainTranslator]: Completed translation [2023-08-25 18:46:47,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47 WrapperNode [2023-08-25 18:46:47,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 18:46:47,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 18:46:47,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 18:46:47,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 18:46:47,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,478 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2023-08-25 18:46:47,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 18:46:47,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 18:46:47,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 18:46:47,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 18:46:47,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 18:46:47,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 18:46:47,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 18:46:47,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 18:46:47,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (1/1) ... [2023-08-25 18:46:47,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 18:46:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:46:47,570 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 18:46:47,601 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 18:46:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 18:46:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 18:46:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 18:46:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 18:46:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 18:46:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-25 18:46:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 18:46:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 18:46:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 18:46:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 18:46:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 18:46:47,618 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 18:46:47,746 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 18:46:47,748 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 18:46:48,110 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 18:46:48,120 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 18:46:48,120 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-25 18:46:48,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:46:48 BoogieIcfgContainer [2023-08-25 18:46:48,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 18:46:48,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 18:46:48,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 18:46:48,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 18:46:48,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 06:46:47" (1/3) ... [2023-08-25 18:46:48,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ad62ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:46:48, skipping insertion in model container [2023-08-25 18:46:48,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:46:47" (2/3) ... [2023-08-25 18:46:48,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ad62ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:46:48, skipping insertion in model container [2023-08-25 18:46:48,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:46:48" (3/3) ... [2023-08-25 18:46:48,143 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-25 18:46:48,159 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 18:46:48,160 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-08-25 18:46:48,160 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 18:46:48,285 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-25 18:46:48,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 290 places, 291 transitions, 614 flow [2023-08-25 18:46:48,407 INFO L124 PetriNetUnfolderBase]: 14/287 cut-off events. [2023-08-25 18:46:48,407 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 18:46:48,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 287 events. 14/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 418 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2023-08-25 18:46:48,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 291 transitions, 614 flow [2023-08-25 18:46:48,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 274 transitions, 572 flow [2023-08-25 18:46:48,432 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 18:46:48,440 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 274 transitions, 572 flow [2023-08-25 18:46:48,443 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 274 transitions, 572 flow [2023-08-25 18:46:48,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 274 transitions, 572 flow [2023-08-25 18:46:48,505 INFO L124 PetriNetUnfolderBase]: 14/274 cut-off events. [2023-08-25 18:46:48,505 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 18:46:48,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 274 events. 14/274 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2023-08-25 18:46:48,537 INFO L119 LiptonReduction]: Number of co-enabled transitions 12144 [2023-08-25 18:46:57,173 INFO L134 LiptonReduction]: Checked pairs total: 23572 [2023-08-25 18:46:57,174 INFO L136 LiptonReduction]: Total number of compositions: 345 [2023-08-25 18:46:57,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 18:46:57,192 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;@5ceef383, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 18:46:57,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-08-25 18:46:57,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 18:46:57,194 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 18:46:57,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 18:46:57,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:57,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 18:46:57,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:46:57,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1094, now seen corresponding path program 1 times [2023-08-25 18:46:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297321666] [2023-08-25 18:46:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:57,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:57,288 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 18:46:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297321666] [2023-08-25 18:46:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297321666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:46:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:46:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 18:46:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690880932] [2023-08-25 18:46:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:46:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 18:46:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 18:46:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 18:46:57,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 636 [2023-08-25 18:46:57,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 168 flow. Second operand has 2 states, 2 states have (on average 276.5) internal successors, (553), 2 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:57,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 636 [2023-08-25 18:46:57,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:57,525 INFO L124 PetriNetUnfolderBase]: 976/1347 cut-off events. [2023-08-25 18:46:57,526 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-25 18:46:57,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1347 events. 976/1347 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4185 event pairs, 624 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 2150. Up to 1298 conditions per place. [2023-08-25 18:46:57,539 INFO L140 encePairwiseOnDemand]: 597/636 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-25 18:46:57,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 148 flow [2023-08-25 18:46:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 18:46:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 18:46:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 620 transitions. [2023-08-25 18:46:57,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48742138364779874 [2023-08-25 18:46:57,558 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 620 transitions. [2023-08-25 18:46:57,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 620 transitions. [2023-08-25 18:46:57,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:57,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 620 transitions. [2023-08-25 18:46:57,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 310.0) internal successors, (620), 2 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,576 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 636.0) internal successors, (1908), 3 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,578 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 168 flow. Second operand 2 states and 620 transitions. [2023-08-25 18:46:57,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 148 flow [2023-08-25 18:46:57,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-25 18:46:57,585 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 74 flow [2023-08-25 18:46:57,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-25 18:46:57,590 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -42 predicate places. [2023-08-25 18:46:57,590 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 74 flow [2023-08-25 18:46:57,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 276.5) internal successors, (553), 2 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:57,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 18:46:57,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 18:46:57,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:46:57,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 33854469, now seen corresponding path program 1 times [2023-08-25 18:46:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:57,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748551658] [2023-08-25 18:46:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:57,680 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 18:46:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:57,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748551658] [2023-08-25 18:46:57,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748551658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:46:57,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:46:57,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 18:46:57,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587586722] [2023-08-25 18:46:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:46:57,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 18:46:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 18:46:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 18:46:57,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 636 [2023-08-25 18:46:57,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:57,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 636 [2023-08-25 18:46:57,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:57,807 INFO L124 PetriNetUnfolderBase]: 995/1324 cut-off events. [2023-08-25 18:46:57,807 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-25 18:46:57,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1324 events. 995/1324 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3826 event pairs, 376 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2691. Up to 1315 conditions per place. [2023-08-25 18:46:57,814 INFO L140 encePairwiseOnDemand]: 628/636 looper letters, 36 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-25 18:46:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 171 flow [2023-08-25 18:46:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 18:46:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 18:46:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-25 18:46:57,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4334381551362683 [2023-08-25 18:46:57,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-25 18:46:57,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-25 18:46:57,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:57,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-25 18:46:57,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,824 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 74 flow. Second operand 3 states and 827 transitions. [2023-08-25 18:46:57,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 171 flow [2023-08-25 18:46:57,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 171 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:46:57,826 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 94 flow [2023-08-25 18:46:57,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2023-08-25 18:46:57,827 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -43 predicate places. [2023-08-25 18:46:57,827 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 94 flow [2023-08-25 18:46:57,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:57,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:57,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:46:57,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 18:46:57,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:46:57,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -357065963, now seen corresponding path program 1 times [2023-08-25 18:46:57,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:57,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839102115] [2023-08-25 18:46:57,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:57,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:58,208 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 18:46:58,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:58,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839102115] [2023-08-25 18:46:58,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839102115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:46:58,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:46:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 18:46:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525485541] [2023-08-25 18:46:58,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:46:58,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 18:46:58,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 18:46:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 18:46:58,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 636 [2023-08-25 18:46:58,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:58,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 636 [2023-08-25 18:46:58,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:58,519 INFO L124 PetriNetUnfolderBase]: 1951/2591 cut-off events. [2023-08-25 18:46:58,520 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2023-08-25 18:46:58,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 2591 events. 1951/2591 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8866 event pairs, 528 based on Foata normal form. 1/1888 useless extension candidates. Maximal degree in co-relation 5985. Up to 1648 conditions per place. [2023-08-25 18:46:58,535 INFO L140 encePairwiseOnDemand]: 630/636 looper letters, 53 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2023-08-25 18:46:58,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 279 flow [2023-08-25 18:46:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 18:46:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 18:46:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2023-08-25 18:46:58,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4224318658280922 [2023-08-25 18:46:58,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 806 transitions. [2023-08-25 18:46:58,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 806 transitions. [2023-08-25 18:46:58,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:58,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 806 transitions. [2023-08-25 18:46:58,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 636.0) internal successors, (2544), 4 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,546 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 94 flow. Second operand 3 states and 806 transitions. [2023-08-25 18:46:58,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 279 flow [2023-08-25 18:46:58,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:46:58,549 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 127 flow [2023-08-25 18:46:58,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-08-25 18:46:58,551 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -40 predicate places. [2023-08-25 18:46:58,551 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 127 flow [2023-08-25 18:46:58,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:58,552 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:46:58,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 18:46:58,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:46:58,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -606165876, now seen corresponding path program 1 times [2023-08-25 18:46:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394786670] [2023-08-25 18:46:58,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:58,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394786670] [2023-08-25 18:46:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394786670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:46:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:46:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:46:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373478234] [2023-08-25 18:46:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:46:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:46:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:46:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:46:58,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:46:58,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:58,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:58,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:46:58,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:59,123 INFO L124 PetriNetUnfolderBase]: 2834/3770 cut-off events. [2023-08-25 18:46:59,124 INFO L125 PetriNetUnfolderBase]: For 1696/1696 co-relation queries the response was YES. [2023-08-25 18:46:59,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10035 conditions, 3770 events. 2834/3770 cut-off events. For 1696/1696 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14238 event pairs, 307 based on Foata normal form. 50/3820 useless extension candidates. Maximal degree in co-relation 10029. Up to 1515 conditions per place. [2023-08-25 18:46:59,146 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 91 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-08-25 18:46:59,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 101 transitions, 523 flow [2023-08-25 18:46:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:46:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:46:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1376 transitions. [2023-08-25 18:46:59,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327044025157233 [2023-08-25 18:46:59,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1376 transitions. [2023-08-25 18:46:59,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1376 transitions. [2023-08-25 18:46:59,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:59,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1376 transitions. [2023-08-25 18:46:59,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 275.2) internal successors, (1376), 5 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:59,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:59,160 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:59,160 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 127 flow. Second operand 5 states and 1376 transitions. [2023-08-25 18:46:59,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 101 transitions, 523 flow [2023-08-25 18:46:59,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 101 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 18:46:59,164 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 187 flow [2023-08-25 18:46:59,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2023-08-25 18:46:59,164 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -35 predicate places. [2023-08-25 18:46:59,165 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 187 flow [2023-08-25 18:46:59,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:59,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:59,165 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:46:59,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 18:46:59,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:46:59,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1618496130, now seen corresponding path program 2 times [2023-08-25 18:46:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303776706] [2023-08-25 18:46:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303776706] [2023-08-25 18:46:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303776706] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:46:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654951927] [2023-08-25 18:46:59,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:46:59,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:46:59,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:46:59,248 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 18:46:59,251 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 18:46:59,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:46:59,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:46:59,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:46:59,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:46:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:59,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:46:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654951927] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:46:59,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:46:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:46:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275694750] [2023-08-25 18:46:59,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:46:59,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:46:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:46:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:46:59,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:46:59,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:59,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:59,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:46:59,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:00,059 INFO L124 PetriNetUnfolderBase]: 3452/4580 cut-off events. [2023-08-25 18:47:00,059 INFO L125 PetriNetUnfolderBase]: For 4114/4114 co-relation queries the response was YES. [2023-08-25 18:47:00,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13860 conditions, 4580 events. 3452/4580 cut-off events. For 4114/4114 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 17586 event pairs, 1073 based on Foata normal form. 96/4676 useless extension candidates. Maximal degree in co-relation 13852. Up to 2187 conditions per place. [2023-08-25 18:47:00,096 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 91 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-08-25 18:47:00,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 101 transitions, 574 flow [2023-08-25 18:47:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1376 transitions. [2023-08-25 18:47:00,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4327044025157233 [2023-08-25 18:47:00,100 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1376 transitions. [2023-08-25 18:47:00,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1376 transitions. [2023-08-25 18:47:00,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:00,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1376 transitions. [2023-08-25 18:47:00,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 275.2) internal successors, (1376), 5 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,111 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,111 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 187 flow. Second operand 5 states and 1376 transitions. [2023-08-25 18:47:00,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 101 transitions, 574 flow [2023-08-25 18:47:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 101 transitions, 574 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:47:00,117 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 241 flow [2023-08-25 18:47:00,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-25 18:47:00,118 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -29 predicate places. [2023-08-25 18:47:00,118 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 241 flow [2023-08-25 18:47:00,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:00,119 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:00,129 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 18:47:00,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:00,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:00,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1164304030, now seen corresponding path program 1 times [2023-08-25 18:47:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312808504] [2023-08-25 18:47:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312808504] [2023-08-25 18:47:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312808504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:47:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:47:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:47:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226606064] [2023-08-25 18:47:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:47:00,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:00,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:00,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:00,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:00,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:00,894 INFO L124 PetriNetUnfolderBase]: 3366/4494 cut-off events. [2023-08-25 18:47:00,894 INFO L125 PetriNetUnfolderBase]: For 6847/6847 co-relation queries the response was YES. [2023-08-25 18:47:00,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14474 conditions, 4494 events. 3366/4494 cut-off events. For 6847/6847 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17997 event pairs, 325 based on Foata normal form. 86/4580 useless extension candidates. Maximal degree in co-relation 14463. Up to 1835 conditions per place. [2023-08-25 18:47:00,923 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 94 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2023-08-25 18:47:00,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 102 transitions, 610 flow [2023-08-25 18:47:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1375 transitions. [2023-08-25 18:47:00,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43238993710691825 [2023-08-25 18:47:00,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1375 transitions. [2023-08-25 18:47:00,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1375 transitions. [2023-08-25 18:47:00,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:00,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1375 transitions. [2023-08-25 18:47:00,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,936 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 241 flow. Second operand 5 states and 1375 transitions. [2023-08-25 18:47:00,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 102 transitions, 610 flow [2023-08-25 18:47:00,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 102 transitions, 601 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-25 18:47:00,958 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 246 flow [2023-08-25 18:47:00,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-25 18:47:00,958 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -25 predicate places. [2023-08-25 18:47:00,959 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 246 flow [2023-08-25 18:47:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:00,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:00,959 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:00,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 18:47:00,960 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:00,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1060337259, now seen corresponding path program 1 times [2023-08-25 18:47:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:00,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607526238] [2023-08-25 18:47:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607526238] [2023-08-25 18:47:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607526238] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664233507] [2023-08-25 18:47:01,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:01,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:01,038 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 18:47:01,063 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 18:47:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:01,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:47:01,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:47:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:01,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:47:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664233507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:47:01,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:47:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:47:01,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020508729] [2023-08-25 18:47:01,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:47:01,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:01,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:01,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:01,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:01,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:01,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:01,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:01,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:02,065 INFO L124 PetriNetUnfolderBase]: 6659/8891 cut-off events. [2023-08-25 18:47:02,066 INFO L125 PetriNetUnfolderBase]: For 17999/17999 co-relation queries the response was YES. [2023-08-25 18:47:02,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29948 conditions, 8891 events. 6659/8891 cut-off events. For 17999/17999 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 38146 event pairs, 1515 based on Foata normal form. 208/9099 useless extension candidates. Maximal degree in co-relation 29936. Up to 3019 conditions per place. [2023-08-25 18:47:02,126 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 121 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2023-08-25 18:47:02,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 129 transitions, 963 flow [2023-08-25 18:47:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1374 transitions. [2023-08-25 18:47:02,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4320754716981132 [2023-08-25 18:47:02,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1374 transitions. [2023-08-25 18:47:02,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1374 transitions. [2023-08-25 18:47:02,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:02,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1374 transitions. [2023-08-25 18:47:02,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.8) internal successors, (1374), 5 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:02,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:02,138 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:02,138 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 246 flow. Second operand 5 states and 1374 transitions. [2023-08-25 18:47:02,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 129 transitions, 963 flow [2023-08-25 18:47:02,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 129 transitions, 938 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 18:47:02,152 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 292 flow [2023-08-25 18:47:02,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-25 18:47:02,152 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -19 predicate places. [2023-08-25 18:47:02,152 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 292 flow [2023-08-25 18:47:02,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:02,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:02,153 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:02,161 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 18:47:02,358 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,SelfDestructingSolverStorable6 [2023-08-25 18:47:02,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:02,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -473094919, now seen corresponding path program 1 times [2023-08-25 18:47:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:02,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247085851] [2023-08-25 18:47:02,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:02,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:02,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247085851] [2023-08-25 18:47:02,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247085851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:47:02,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:47:02,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:47:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492773837] [2023-08-25 18:47:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:47:02,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:02,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:02,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:02,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:02,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:02,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:02,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:03,240 INFO L124 PetriNetUnfolderBase]: 6587/8819 cut-off events. [2023-08-25 18:47:03,240 INFO L125 PetriNetUnfolderBase]: For 19243/19243 co-relation queries the response was YES. [2023-08-25 18:47:03,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33262 conditions, 8819 events. 6587/8819 cut-off events. For 19243/19243 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 38211 event pairs, 739 based on Foata normal form. 72/8891 useless extension candidates. Maximal degree in co-relation 33246. Up to 4349 conditions per place. [2023-08-25 18:47:03,313 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 123 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-08-25 18:47:03,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 133 transitions, 1020 flow [2023-08-25 18:47:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1372 transitions. [2023-08-25 18:47:03,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43144654088050316 [2023-08-25 18:47:03,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1372 transitions. [2023-08-25 18:47:03,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1372 transitions. [2023-08-25 18:47:03,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:03,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1372 transitions. [2023-08-25 18:47:03,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.4) internal successors, (1372), 5 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:03,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:03,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:03,325 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 292 flow. Second operand 5 states and 1372 transitions. [2023-08-25 18:47:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 133 transitions, 1020 flow [2023-08-25 18:47:03,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 133 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:47:03,392 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 355 flow [2023-08-25 18:47:03,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-25 18:47:03,395 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -14 predicate places. [2023-08-25 18:47:03,395 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 355 flow [2023-08-25 18:47:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:03,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:03,395 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:03,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 18:47:03,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:03,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -344105967, now seen corresponding path program 2 times [2023-08-25 18:47:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340962700] [2023-08-25 18:47:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:03,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340962700] [2023-08-25 18:47:03,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340962700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:47:03,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:47:03,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:47:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433083477] [2023-08-25 18:47:03,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:47:03,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:03,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:03,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:03,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:03,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:03,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:03,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:03,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:04,167 INFO L124 PetriNetUnfolderBase]: 6069/8089 cut-off events. [2023-08-25 18:47:04,167 INFO L125 PetriNetUnfolderBase]: For 19901/19901 co-relation queries the response was YES. [2023-08-25 18:47:04,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32263 conditions, 8089 events. 6069/8089 cut-off events. For 19901/19901 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 34386 event pairs, 667 based on Foata normal form. 68/8157 useless extension candidates. Maximal degree in co-relation 32245. Up to 3557 conditions per place. [2023-08-25 18:47:04,236 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 117 selfloop transitions, 9 changer transitions 4/130 dead transitions. [2023-08-25 18:47:04,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 130 transitions, 1025 flow [2023-08-25 18:47:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1371 transitions. [2023-08-25 18:47:04,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43113207547169813 [2023-08-25 18:47:04,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1371 transitions. [2023-08-25 18:47:04,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1371 transitions. [2023-08-25 18:47:04,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:04,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1371 transitions. [2023-08-25 18:47:04,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.2) internal successors, (1371), 5 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:04,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:04,247 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:04,247 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 355 flow. Second operand 5 states and 1371 transitions. [2023-08-25 18:47:04,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 130 transitions, 1025 flow [2023-08-25 18:47:04,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 130 transitions, 1012 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 18:47:04,320 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 355 flow [2023-08-25 18:47:04,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-08-25 18:47:04,320 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -10 predicate places. [2023-08-25 18:47:04,321 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 355 flow [2023-08-25 18:47:04,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:04,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:04,321 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:04,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 18:47:04,322 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:04,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:04,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1505671215, now seen corresponding path program 2 times [2023-08-25 18:47:04,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:04,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780185740] [2023-08-25 18:47:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780185740] [2023-08-25 18:47:04,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780185740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515088605] [2023-08-25 18:47:04,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:47:04,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:04,399 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 18:47:04,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 18:47:04,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:47:04,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:47:04,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:47:04,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:47:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:04,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:47:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515088605] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:47:04,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:47:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:47:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860547469] [2023-08-25 18:47:04,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:47:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:04,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:04,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:04,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:04,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:04,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:05,660 INFO L124 PetriNetUnfolderBase]: 7377/9805 cut-off events. [2023-08-25 18:47:05,660 INFO L125 PetriNetUnfolderBase]: For 25818/25818 co-relation queries the response was YES. [2023-08-25 18:47:05,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39737 conditions, 9805 events. 7377/9805 cut-off events. For 25818/25818 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 41581 event pairs, 1663 based on Foata normal form. 204/10009 useless extension candidates. Maximal degree in co-relation 39718. Up to 5287 conditions per place. [2023-08-25 18:47:05,794 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 120 selfloop transitions, 8 changer transitions 0/128 dead transitions. [2023-08-25 18:47:05,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 1037 flow [2023-08-25 18:47:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1368 transitions. [2023-08-25 18:47:05,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43018867924528303 [2023-08-25 18:47:05,798 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1368 transitions. [2023-08-25 18:47:05,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1368 transitions. [2023-08-25 18:47:05,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:05,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1368 transitions. [2023-08-25 18:47:05,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 273.6) internal successors, (1368), 5 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:05,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:05,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:05,807 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 355 flow. Second operand 5 states and 1368 transitions. [2023-08-25 18:47:05,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 1037 flow [2023-08-25 18:47:05,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 1028 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 18:47:05,841 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 396 flow [2023-08-25 18:47:05,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2023-08-25 18:47:05,842 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -5 predicate places. [2023-08-25 18:47:05,842 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 396 flow [2023-08-25 18:47:05,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:05,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:05,843 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, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:05,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 18:47:06,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:06,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:06,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1480698706, now seen corresponding path program 2 times [2023-08-25 18:47:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553126263] [2023-08-25 18:47:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553126263] [2023-08-25 18:47:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553126263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118639096] [2023-08-25 18:47:06,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:47:06,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:06,154 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 18:47:06,156 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 18:47:06,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:47:06,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:47:06,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:47:06,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:47:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:06,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:47:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118639096] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:47:06,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:47:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:47:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788449194] [2023-08-25 18:47:06,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:47:06,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:47:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:47:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:47:06,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 636 [2023-08-25 18:47:06,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:06,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:06,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 636 [2023-08-25 18:47:06,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:07,587 INFO L124 PetriNetUnfolderBase]: 8853/11725 cut-off events. [2023-08-25 18:47:07,588 INFO L125 PetriNetUnfolderBase]: For 35640/35640 co-relation queries the response was YES. [2023-08-25 18:47:07,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49914 conditions, 11725 events. 8853/11725 cut-off events. For 35640/35640 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 50925 event pairs, 3073 based on Foata normal form. 222/11947 useless extension candidates. Maximal degree in co-relation 49892. Up to 6575 conditions per place. [2023-08-25 18:47:07,685 INFO L140 encePairwiseOnDemand]: 631/636 looper letters, 136 selfloop transitions, 8 changer transitions 0/144 dead transitions. [2023-08-25 18:47:07,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 144 transitions, 1226 flow [2023-08-25 18:47:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:47:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:47:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1372 transitions. [2023-08-25 18:47:07,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43144654088050316 [2023-08-25 18:47:07,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1372 transitions. [2023-08-25 18:47:07,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1372 transitions. [2023-08-25 18:47:07,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:07,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1372 transitions. [2023-08-25 18:47:07,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.4) internal successors, (1372), 5 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:07,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:07,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 636.0) internal successors, (3816), 6 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:07,700 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 396 flow. Second operand 5 states and 1372 transitions. [2023-08-25 18:47:07,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 144 transitions, 1226 flow [2023-08-25 18:47:07,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 1168 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-25 18:47:07,792 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 433 flow [2023-08-25 18:47:07,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-08-25 18:47:07,792 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2023-08-25 18:47:07,793 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 433 flow [2023-08-25 18:47:07,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:07,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:07,793 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:07,803 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 18:47:07,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:08,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:08,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 180980481, now seen corresponding path program 1 times [2023-08-25 18:47:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503216979] [2023-08-25 18:47:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503216979] [2023-08-25 18:47:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503216979] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39830193] [2023-08-25 18:47:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:08,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:08,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:08,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:47:08,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 18:47:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:09,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-25 18:47:09,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:47:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:16,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:47:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39830193] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:47:21,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:47:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 18:47:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613856183] [2023-08-25 18:47:21,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:47:21,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:47:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:47:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:47:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=146, Unknown=1, NotChecked=0, Total=210 [2023-08-25 18:47:21,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:47:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 433 flow. Second operand has 15 states, 15 states have (on average 252.6) internal successors, (3789), 15 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:21,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:47:21,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:47:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:47:24,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:32,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:38,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:42,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:44,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:46,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:54,633 INFO L124 PetriNetUnfolderBase]: 15946/21271 cut-off events. [2023-08-25 18:47:54,633 INFO L125 PetriNetUnfolderBase]: For 66410/66410 co-relation queries the response was YES. [2023-08-25 18:47:54,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90705 conditions, 21271 events. 15946/21271 cut-off events. For 66410/66410 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 102246 event pairs, 2444 based on Foata normal form. 31/21302 useless extension candidates. Maximal degree in co-relation 90681. Up to 11472 conditions per place. [2023-08-25 18:47:54,869 INFO L140 encePairwiseOnDemand]: 628/636 looper letters, 282 selfloop transitions, 97 changer transitions 28/407 dead transitions. [2023-08-25 18:47:54,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 407 transitions, 3297 flow [2023-08-25 18:47:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-25 18:47:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-25 18:47:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4527 transitions. [2023-08-25 18:47:54,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41870144284128746 [2023-08-25 18:47:54,886 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4527 transitions. [2023-08-25 18:47:54,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4527 transitions. [2023-08-25 18:47:54,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:54,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4527 transitions. [2023-08-25 18:47:54,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 266.29411764705884) internal successors, (4527), 17 states have internal predecessors, (4527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:54,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 636.0) internal successors, (11448), 18 states have internal predecessors, (11448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:54,909 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 636.0) internal successors, (11448), 18 states have internal predecessors, (11448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:54,910 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 433 flow. Second operand 17 states and 4527 transitions. [2023-08-25 18:47:54,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 407 transitions, 3297 flow [2023-08-25 18:47:55,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 407 transitions, 3204 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-08-25 18:47:55,129 INFO L231 Difference]: Finished difference. Result has 102 places, 156 transitions, 1656 flow [2023-08-25 18:47:55,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1656, PETRI_PLACES=102, PETRI_TRANSITIONS=156} [2023-08-25 18:47:55,130 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 25 predicate places. [2023-08-25 18:47:55,130 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 156 transitions, 1656 flow [2023-08-25 18:47:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 252.6) internal successors, (3789), 15 states have internal predecessors, (3789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:55,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:55,131 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:55,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 18:47:55,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-25 18:47:55,337 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:47:55,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -978651227, now seen corresponding path program 2 times [2023-08-25 18:47:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902758972] [2023-08-25 18:47:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:55,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902758972] [2023-08-25 18:47:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902758972] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:55,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232523279] [2023-08-25 18:47:55,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:47:55,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:55,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:55,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:47:55,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 18:47:58,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:47:58,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:47:58,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-25 18:47:58,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:48:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:48:03,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:48:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:48:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232523279] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:48:05,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:48:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 18:48:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640054515] [2023-08-25 18:48:05,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:48:05,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:48:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:48:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:48:05,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=140, Unknown=1, NotChecked=0, Total=210 [2023-08-25 18:48:05,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:48:05,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 156 transitions, 1656 flow. Second operand has 15 states, 15 states have (on average 252.26666666666668) internal successors, (3784), 15 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:05,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:48:05,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:48:05,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:48:08,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:12,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:15,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:17,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:21,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:23,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:25,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:27,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:40,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:49,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:51,351 INFO L124 PetriNetUnfolderBase]: 23408/31187 cut-off events. [2023-08-25 18:48:51,351 INFO L125 PetriNetUnfolderBase]: For 160412/160412 co-relation queries the response was YES. [2023-08-25 18:48:51,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152218 conditions, 31187 events. 23408/31187 cut-off events. For 160412/160412 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 159315 event pairs, 3090 based on Foata normal form. 56/31243 useless extension candidates. Maximal degree in co-relation 152182. Up to 19876 conditions per place. [2023-08-25 18:48:51,665 INFO L140 encePairwiseOnDemand]: 628/636 looper letters, 386 selfloop transitions, 149 changer transitions 23/558 dead transitions. [2023-08-25 18:48:51,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 558 transitions, 5457 flow [2023-08-25 18:48:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-25 18:48:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-25 18:48:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6057 transitions. [2023-08-25 18:48:51,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140689089417555 [2023-08-25 18:48:51,681 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 6057 transitions. [2023-08-25 18:48:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 6057 transitions. [2023-08-25 18:48:51,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:48:51,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 6057 transitions. [2023-08-25 18:48:51,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 263.3478260869565) internal successors, (6057), 23 states have internal predecessors, (6057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:51,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:51,720 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 636.0) internal successors, (15264), 24 states have internal predecessors, (15264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:51,720 INFO L175 Difference]: Start difference. First operand has 102 places, 156 transitions, 1656 flow. Second operand 23 states and 6057 transitions. [2023-08-25 18:48:51,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 558 transitions, 5457 flow [2023-08-25 18:48:52,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 5266 flow, removed 93 selfloop flow, removed 1 redundant places. [2023-08-25 18:48:52,688 INFO L231 Difference]: Finished difference. Result has 131 places, 279 transitions, 3435 flow [2023-08-25 18:48:52,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3435, PETRI_PLACES=131, PETRI_TRANSITIONS=279} [2023-08-25 18:48:52,688 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 54 predicate places. [2023-08-25 18:48:52,689 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 279 transitions, 3435 flow [2023-08-25 18:48:52,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 252.26666666666668) internal successors, (3784), 15 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:52,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:48:52,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:48:52,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-25 18:48:52,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:48:52,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:48:52,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:48:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2097382789, now seen corresponding path program 1 times [2023-08-25 18:48:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:48:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657467740] [2023-08-25 18:48:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:48:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:48:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:48:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:48:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:48:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657467740] [2023-08-25 18:48:53,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657467740] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:48:53,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786375274] [2023-08-25 18:48:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:48:53,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:48:53,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:48:53,693 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:48:53,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 18:48:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:48:54,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-25 18:48:54,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:49:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:49:05,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:49:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:49:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786375274] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:49:09,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:49:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-08-25 18:49:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802256213] [2023-08-25 18:49:09,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:49:09,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 18:49:09,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:49:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 18:49:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=118, Unknown=4, NotChecked=0, Total=156 [2023-08-25 18:49:09,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:49:09,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 279 transitions, 3435 flow. Second operand has 13 states, 13 states have (on average 252.92307692307693) internal successors, (3288), 13 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:49:09,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:49:09,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:49:09,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:49:11,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:13,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:15,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:41,638 WARN L234 SmtUtils]: Spent 24.34s on a formula simplification. DAG size of input: 82 DAG size of output: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 18:49:44,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:45,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:47,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:50,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:52,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:55,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:49:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:08,446 WARN L234 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 50 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 18:50:23,221 WARN L234 SmtUtils]: Spent 8.00s on a formula simplification. DAG size of input: 59 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 18:50:26,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:27,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:31,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:38,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:40,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:50,849 INFO L124 PetriNetUnfolderBase]: 27686/36960 cut-off events. [2023-08-25 18:50:50,849 INFO L125 PetriNetUnfolderBase]: For 234674/234674 co-relation queries the response was YES. [2023-08-25 18:50:51,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191678 conditions, 36960 events. 27686/36960 cut-off events. For 234674/234674 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 195318 event pairs, 3620 based on Foata normal form. 2/36962 useless extension candidates. Maximal degree in co-relation 191633. Up to 31156 conditions per place. [2023-08-25 18:50:51,193 INFO L140 encePairwiseOnDemand]: 617/636 looper letters, 410 selfloop transitions, 47 changer transitions 9/466 dead transitions. [2023-08-25 18:50:51,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 466 transitions, 5385 flow [2023-08-25 18:50:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 18:50:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 18:50:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2681 transitions. [2023-08-25 18:50:51,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42154088050314464 [2023-08-25 18:50:51,200 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2681 transitions. [2023-08-25 18:50:51,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2681 transitions. [2023-08-25 18:50:51,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:50:51,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2681 transitions. [2023-08-25 18:50:51,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 268.1) internal successors, (2681), 10 states have internal predecessors, (2681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:50:51,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 636.0) internal successors, (6996), 11 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:50:51,213 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 636.0) internal successors, (6996), 11 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:50:51,213 INFO L175 Difference]: Start difference. First operand has 131 places, 279 transitions, 3435 flow. Second operand 10 states and 2681 transitions. [2023-08-25 18:50:51,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 466 transitions, 5385 flow [2023-08-25 18:50:53,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 466 transitions, 4850 flow, removed 265 selfloop flow, removed 1 redundant places. [2023-08-25 18:50:53,194 INFO L231 Difference]: Finished difference. Result has 145 places, 321 transitions, 3511 flow [2023-08-25 18:50:53,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3511, PETRI_PLACES=145, PETRI_TRANSITIONS=321} [2023-08-25 18:50:53,195 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 68 predicate places. [2023-08-25 18:50:53,195 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 321 transitions, 3511 flow [2023-08-25 18:50:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 252.92307692307693) internal successors, (3288), 13 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:50:53,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:50:53,196 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:50:53,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 18:50:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:50:53,396 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:50:53,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:50:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash -961243423, now seen corresponding path program 2 times [2023-08-25 18:50:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:50:53,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611107665] [2023-08-25 18:50:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:50:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:50:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:50:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:50:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:50:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611107665] [2023-08-25 18:50:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611107665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:50:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563319159] [2023-08-25 18:50:53,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:50:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:50:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:50:53,899 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:50:53,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-25 18:50:54,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:50:54,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:50:54,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-25 18:50:54,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:51:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:51:03,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:51:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:51:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563319159] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:51:04,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:51:04,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-08-25 18:51:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296565047] [2023-08-25 18:51:04,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:51:04,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 18:51:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:51:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 18:51:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=110, Unknown=2, NotChecked=0, Total=156 [2023-08-25 18:51:04,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:51:04,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 321 transitions, 3511 flow. Second operand has 13 states, 13 states have (on average 252.92307692307693) internal successors, (3288), 13 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:51:04,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:51:04,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:51:04,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:51:11,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:14,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:16,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:18,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:21,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:24,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:30,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:33,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:35,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:37,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:39,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:41,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:43,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:46,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:48,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:51,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:53,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:56,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:59,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:02,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:07,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:09,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:11,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:14,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:17,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:22,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:24,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:28,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:30,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:32,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:35,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:35,250 INFO L124 PetriNetUnfolderBase]: 36028/48231 cut-off events. [2023-08-25 18:52:35,250 INFO L125 PetriNetUnfolderBase]: For 333974/333974 co-relation queries the response was YES. [2023-08-25 18:52:35,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269648 conditions, 48231 events. 36028/48231 cut-off events. For 333974/333974 co-relation queries the response was YES. Maximal size of possible extension queue 1435. Compared 265618 event pairs, 4920 based on Foata normal form. 4/48235 useless extension candidates. Maximal degree in co-relation 269596. Up to 35191 conditions per place. [2023-08-25 18:52:35,851 INFO L140 encePairwiseOnDemand]: 628/636 looper letters, 510 selfloop transitions, 51 changer transitions 10/571 dead transitions. [2023-08-25 18:52:35,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 571 transitions, 6590 flow [2023-08-25 18:52:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 18:52:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 18:52:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2968 transitions. [2023-08-25 18:52:35,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2023-08-25 18:52:35,858 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2968 transitions. [2023-08-25 18:52:35,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2968 transitions. [2023-08-25 18:52:35,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:52:35,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2968 transitions. [2023-08-25 18:52:35,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 269.8181818181818) internal successors, (2968), 11 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:52:35,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 636.0) internal successors, (7632), 12 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:52:35,870 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 636.0) internal successors, (7632), 12 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:52:35,871 INFO L175 Difference]: Start difference. First operand has 145 places, 321 transitions, 3511 flow. Second operand 11 states and 2968 transitions. [2023-08-25 18:52:35,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 571 transitions, 6590 flow [2023-08-25 18:52:37,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 571 transitions, 6461 flow, removed 62 selfloop flow, removed 1 redundant places. [2023-08-25 18:52:37,566 INFO L231 Difference]: Finished difference. Result has 161 places, 366 transitions, 4242 flow [2023-08-25 18:52:37,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=3388, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4242, PETRI_PLACES=161, PETRI_TRANSITIONS=366} [2023-08-25 18:52:37,567 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 84 predicate places. [2023-08-25 18:52:37,567 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 366 transitions, 4242 flow [2023-08-25 18:52:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 252.92307692307693) internal successors, (3288), 13 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:52:37,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:52:37,568 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:52:37,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-25 18:52:37,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 18:52:37,768 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:52:37,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:52:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash -74328657, now seen corresponding path program 3 times [2023-08-25 18:52:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:52:37,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573142939] [2023-08-25 18:52:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:52:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:52:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:52:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:52:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:52:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573142939] [2023-08-25 18:52:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573142939] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:52:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992874709] [2023-08-25 18:52:37,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 18:52:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:52:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:52:37,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:52:37,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-25 18:52:57,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-25 18:52:57,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:52:57,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-25 18:52:57,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:53:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:53:18,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:53:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:53:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992874709] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:53:44,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:53:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 17 [2023-08-25 18:53:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769118543] [2023-08-25 18:53:44,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:53:44,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-25 18:53:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:53:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-25 18:53:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=207, Unknown=16, NotChecked=0, Total=306 [2023-08-25 18:53:44,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:53:44,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 366 transitions, 4242 flow. Second operand has 18 states, 18 states have (on average 252.83333333333334) internal successors, (4551), 18 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:53:44,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:53:44,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:53:44,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:53:54,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:56,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:02,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:06,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:08,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:15,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:22,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:24,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:27,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:46,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:54:48,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:25,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:27,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:35,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:37,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:39,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:41,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 [] [2023-08-25 18:55:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:45,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:47,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:49,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:51,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:53,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:56,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:55:58,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:00,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:02,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:05,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:07,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:09,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:11,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:13,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:15,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:17,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:19,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:20,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:23,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:25,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:27,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:43,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:45,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:47,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:53,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:55,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:57,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:56:59,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:02,804 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 [] [2023-08-25 18:57:04,837 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 [] [2023-08-25 18:57:05,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:07,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:10,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:13,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:15,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:18,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 [] [2023-08-25 18:57:22,582 INFO L124 PetriNetUnfolderBase]: 65417/87116 cut-off events. [2023-08-25 18:57:22,583 INFO L125 PetriNetUnfolderBase]: For 903727/903727 co-relation queries the response was YES. [2023-08-25 18:57:23,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533045 conditions, 87116 events. 65417/87116 cut-off events. For 903727/903727 co-relation queries the response was YES. Maximal size of possible extension queue 2244. Compared 499975 event pairs, 2837 based on Foata normal form. 624/87740 useless extension candidates. Maximal degree in co-relation 532985. Up to 37100 conditions per place. [2023-08-25 18:57:24,118 INFO L140 encePairwiseOnDemand]: 625/636 looper letters, 811 selfloop transitions, 350 changer transitions 80/1241 dead transitions. [2023-08-25 18:57:24,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1241 transitions, 15931 flow [2023-08-25 18:57:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-25 18:57:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-25 18:57:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 7679 transitions. [2023-08-25 18:57:24,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163413576230753 [2023-08-25 18:57:24,153 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 7679 transitions. [2023-08-25 18:57:24,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 7679 transitions. [2023-08-25 18:57:24,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:57:24,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 7679 transitions. [2023-08-25 18:57:24,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 264.7931034482759) internal successors, (7679), 29 states have internal predecessors, (7679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:57:24,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 636.0) internal successors, (19080), 30 states have internal predecessors, (19080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:57:24,216 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 636.0) internal successors, (19080), 30 states have internal predecessors, (19080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:57:24,216 INFO L175 Difference]: Start difference. First operand has 161 places, 366 transitions, 4242 flow. Second operand 29 states and 7679 transitions. [2023-08-25 18:57:24,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1241 transitions, 15931 flow [2023-08-25 18:57:30,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1241 transitions, 15054 flow, removed 434 selfloop flow, removed 1 redundant places. [2023-08-25 18:57:30,883 INFO L231 Difference]: Finished difference. Result has 204 places, 603 transitions, 8707 flow [2023-08-25 18:57:30,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=3949, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=8707, PETRI_PLACES=204, PETRI_TRANSITIONS=603} [2023-08-25 18:57:30,884 INFO L281 CegarLoopForPetriNet]: 77 programPoint places, 127 predicate places. [2023-08-25 18:57:30,884 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 603 transitions, 8707 flow [2023-08-25 18:57:30,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 252.83333333333334) internal successors, (4551), 18 states have internal predecessors, (4551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:57:30,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:57:30,885 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:57:30,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-25 18:57:31,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-25 18:57:31,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 18:57:31,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:57:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -735047225, now seen corresponding path program 4 times [2023-08-25 18:57:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:57:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946778118] [2023-08-25 18:57:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:57:31,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:57:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:57:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:57:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:57:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946778118] [2023-08-25 18:57:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946778118] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:57:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935827232] [2023-08-25 18:57:31,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 18:57:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:57:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:57:31,264 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:57:31,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-25 18:58:18,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 18:58:18,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:58:18,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-25 18:58:18,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:58:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:58:45,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:59:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:59:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935827232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:59:12,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:59:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2023-08-25 18:59:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503647405] [2023-08-25 18:59:12,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:59:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-25 18:59:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:59:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-25 18:59:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=168, Unknown=17, NotChecked=0, Total=240 [2023-08-25 18:59:12,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 636 [2023-08-25 18:59:12,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 603 transitions, 8707 flow. Second operand has 16 states, 16 states have (on average 253.5) internal successors, (4056), 16 states have internal predecessors, (4056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:59:12,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:59:12,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 636 [2023-08-25 18:59:12,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:59:15,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:18,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:20,748 WARN L234 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 52 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 19:00:24,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:27,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:29,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:31,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:33,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:35,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:37,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:39,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-25 19:00:50,349 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 19:00:50,369 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 19:00:51,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-25 19:00:51,569 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 19:00:51,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 19:00:51,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 19:00:51,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 19:00:51,577 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-25 19:00:51,584 INFO L158 Benchmark]: Toolchain (without parser) took 844428.14ms. Allocated memory was 356.5MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 331.7MB in the beginning and 657.2MB in the end (delta: -325.4MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-25 19:00:51,585 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory was 334.2MB in the beginning and 334.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 19:00:51,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 356.5MB. Free memory was 331.7MB in the beginning and 320.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 19:00:51,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.55ms. Allocated memory is still 356.5MB. Free memory was 320.5MB in the beginning and 317.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 19:00:51,588 INFO L158 Benchmark]: Boogie Preprocessor took 54.56ms. Allocated memory is still 356.5MB. Free memory was 317.6MB in the beginning and 316.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 19:00:51,588 INFO L158 Benchmark]: RCFGBuilder took 588.11ms. Allocated memory is still 356.5MB. Free memory was 316.3MB in the beginning and 292.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-25 19:00:51,588 INFO L158 Benchmark]: TraceAbstraction took 843459.57ms. Allocated memory was 356.5MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 291.9MB in the beginning and 657.2MB in the end (delta: -365.3MB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-25 19:00:51,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 356.5MB. Free memory was 334.2MB in the beginning and 334.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 356.5MB. Free memory was 331.7MB in the beginning and 320.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.55ms. Allocated memory is still 356.5MB. Free memory was 320.5MB in the beginning and 317.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.56ms. Allocated memory is still 356.5MB. Free memory was 317.6MB in the beginning and 316.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 588.11ms. Allocated memory is still 356.5MB. Free memory was 316.3MB in the beginning and 292.4MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 843459.57ms. Allocated memory was 356.5MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 291.9MB in the beginning and 657.2MB in the end (delta: -365.3MB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 273 PlacesBefore, 77 PlacesAfterwards, 274 TransitionsBefore, 72 TransitionsAfterwards, 12144 CoEnabledTransitionPairs, 9 FixpointIterations, 160 TrivialSequentialCompositions, 149 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 13 ConcurrentYvCompositions, 6 ChoiceCompositions, 345 TotalNumberOfCompositions, 23572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14481, independent: 14248, independent conditional: 0, independent unconditional: 14248, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7562, independent: 7500, independent conditional: 0, independent unconditional: 7500, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14481, independent: 6748, independent conditional: 0, independent unconditional: 6748, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 7562, unknown conditional: 0, unknown unconditional: 7562] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 281, Positive conditional cache size: 0, Positive unconditional cache size: 281, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown