/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:26:26,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:26:26,436 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-SemanticLbe.epf [2023-11-17 11:26:26,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:26:26,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:26:26,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:26:26,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:26:26,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:26:26,468 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:26:26,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:26:26,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:26:26,473 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:26:26,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:26:26,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:26:26,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:26:26,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:26:26,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:26:26,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:26:26,476 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:26:26,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:26:26,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:26:26,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:26:26,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:26:26,477 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:26:26,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:26:26,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:26,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:26:26,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:26:26,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:26:26,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:26:26,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:26:26,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:26:26,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:26:26,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:26:26,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:26:26,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:26:26,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:26:26,785 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:26:26,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-11-17 11:26:28,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:26:28,320 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:26:28,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2023-11-17 11:26:28,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e08519b/22e784ccfcd74ad48c9d22070530f82f/FLAGa8ca6f3bb [2023-11-17 11:26:28,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63e08519b/22e784ccfcd74ad48c9d22070530f82f [2023-11-17 11:26:28,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:26:28,363 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:26:28,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:28,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:26:28,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:26:28,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e31b52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28, skipping insertion in model container [2023-11-17 11:26:28,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,441 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:26:28,610 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2023-11-17 11:26:28,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:28,807 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:26:28,820 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i[949,962] [2023-11-17 11:26:28,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:28,905 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:28,905 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:28,912 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:26:28,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28 WrapperNode [2023-11-17 11:26:28,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:28,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:28,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:26:28,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:26:28,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,973 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-11-17 11:26:28,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:28,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:26:28,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:26:28,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:26:28,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:28,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:26:29,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:26:29,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:26:29,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:26:29,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (1/1) ... [2023-11-17 11:26:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:29,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:26:29,094 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-11-17 11:26:29,106 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-11-17 11:26:29,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:26:29,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:26:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:26:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:26:29,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:26:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:26:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:26:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:26:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:26:29,126 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:26:29,126 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:26:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:26:29,127 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:26:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:26:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:26:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:26:29,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:26:29,128 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:26:29,278 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:26:29,280 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:26:29,671 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:26:29,856 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:26:29,856 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:26:29,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:29 BoogieIcfgContainer [2023-11-17 11:26:29,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:26:29,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:26:29,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:26:29,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:26:29,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:26:28" (1/3) ... [2023-11-17 11:26:29,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599913eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:29, skipping insertion in model container [2023-11-17 11:26:29,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:28" (2/3) ... [2023-11-17 11:26:29,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599913eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:29, skipping insertion in model container [2023-11-17 11:26:29,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:29" (3/3) ... [2023-11-17 11:26:29,866 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2023-11-17 11:26:29,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:26:29,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:26:29,884 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:26:29,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:26:29,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-17 11:26:30,009 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-17 11:26:30,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:26:30,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-17 11:26:30,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:30,023 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:26:30,045 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:30,049 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:30,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:30,069 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-17 11:26:30,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:30,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:26:30,071 INFO L119 LiptonReduction]: Number of co-enabled transitions 1286 [2023-11-17 11:26:31,820 INFO L134 LiptonReduction]: Checked pairs total: 3149 [2023-11-17 11:26:31,820 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-11-17 11:26:31,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:26:31,838 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=LoopHeads, 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;@3f70a2e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:26:31,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:26:31,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:26:31,843 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-17 11:26:31,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:31,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:31,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:31,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:31,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash -574747683, now seen corresponding path program 1 times [2023-11-17 11:26:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163331] [2023-11-17 11:26:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:32,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:32,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163331] [2023-11-17 11:26:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:32,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989969197] [2023-11-17 11:26:32,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:32,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:32,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:32,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:32,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:32,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 72 [2023-11-17 11:26:32,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:32,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:32,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 72 [2023-11-17 11:26:32,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:33,338 INFO L124 PetriNetUnfolderBase]: 4903/6982 cut-off events. [2023-11-17 11:26:33,339 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-17 11:26:33,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13830 conditions, 6982 events. 4903/6982 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 36404 event pairs, 1263 based on Foata normal form. 0/6641 useless extension candidates. Maximal degree in co-relation 13818. Up to 5257 conditions per place. [2023-11-17 11:26:33,382 INFO L140 encePairwiseOnDemand]: 69/72 looper letters, 37 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2023-11-17 11:26:33,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 185 flow [2023-11-17 11:26:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-17 11:26:33,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-11-17 11:26:33,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-17 11:26:33,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-17 11:26:33,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:33,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-17 11:26:33,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:33,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:33,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:33,404 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 120 transitions. [2023-11-17 11:26:33,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 185 flow [2023-11-17 11:26:33,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:33,410 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-11-17 11:26:33,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-17 11:26:33,415 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-17 11:26:33,415 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-11-17 11:26:33,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:33,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:33,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:33,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:26:33,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:33,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1905131895, now seen corresponding path program 1 times [2023-11-17 11:26:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814093539] [2023-11-17 11:26:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814093539] [2023-11-17 11:26:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814093539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:34,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:26:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300817942] [2023-11-17 11:26:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:34,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:34,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 72 [2023-11-17 11:26:34,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:34,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:34,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 72 [2023-11-17 11:26:34,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:35,269 INFO L124 PetriNetUnfolderBase]: 8789/12038 cut-off events. [2023-11-17 11:26:35,270 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2023-11-17 11:26:35,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24970 conditions, 12038 events. 8789/12038 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 57267 event pairs, 2349 based on Foata normal form. 400/12438 useless extension candidates. Maximal degree in co-relation 24960. Up to 7461 conditions per place. [2023-11-17 11:26:35,366 INFO L140 encePairwiseOnDemand]: 60/72 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-11-17 11:26:35,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 232 flow [2023-11-17 11:26:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-11-17 11:26:35,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-11-17 11:26:35,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 136 transitions. [2023-11-17 11:26:35,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 136 transitions. [2023-11-17 11:26:35,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:35,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 136 transitions. [2023-11-17 11:26:35,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:35,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:35,378 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:35,378 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 4 states and 136 transitions. [2023-11-17 11:26:35,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 232 flow [2023-11-17 11:26:35,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:35,383 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 146 flow [2023-11-17 11:26:35,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-17 11:26:35,384 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-17 11:26:35,385 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 146 flow [2023-11-17 11:26:35,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:35,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:35,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:26:35,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:35,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1179290628, now seen corresponding path program 1 times [2023-11-17 11:26:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214977705] [2023-11-17 11:26:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214977705] [2023-11-17 11:26:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214977705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:35,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473268810] [2023-11-17 11:26:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:35,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:35,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 72 [2023-11-17 11:26:35,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:35,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:35,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 72 [2023-11-17 11:26:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:36,688 INFO L124 PetriNetUnfolderBase]: 6013/8710 cut-off events. [2023-11-17 11:26:36,689 INFO L125 PetriNetUnfolderBase]: For 4680/4764 co-relation queries the response was YES. [2023-11-17 11:26:36,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23484 conditions, 8710 events. 6013/8710 cut-off events. For 4680/4764 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 48421 event pairs, 1777 based on Foata normal form. 40/8570 useless extension candidates. Maximal degree in co-relation 23471. Up to 7377 conditions per place. [2023-11-17 11:26:36,757 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 46 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-11-17 11:26:36,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 310 flow [2023-11-17 11:26:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-17 11:26:36,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324074074074074 [2023-11-17 11:26:36,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-17 11:26:36,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-17 11:26:36,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:36,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-17 11:26:36,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:36,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:36,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:36,762 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 146 flow. Second operand 3 states and 115 transitions. [2023-11-17 11:26:36,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 310 flow [2023-11-17 11:26:36,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:36,771 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 178 flow [2023-11-17 11:26:36,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-11-17 11:26:36,773 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-17 11:26:36,773 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 178 flow [2023-11-17 11:26:36,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:36,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:36,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:26:36,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:36,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2096869203, now seen corresponding path program 1 times [2023-11-17 11:26:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865520917] [2023-11-17 11:26:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865520917] [2023-11-17 11:26:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865520917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:37,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:26:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933029517] [2023-11-17 11:26:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:37,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:37,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:37,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:37,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:38,396 INFO L124 PetriNetUnfolderBase]: 7346/10463 cut-off events. [2023-11-17 11:26:38,396 INFO L125 PetriNetUnfolderBase]: For 7658/7670 co-relation queries the response was YES. [2023-11-17 11:26:38,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 10463 events. 7346/10463 cut-off events. For 7658/7670 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 55928 event pairs, 1835 based on Foata normal form. 36/10317 useless extension candidates. Maximal degree in co-relation 30015. Up to 8981 conditions per place. [2023-11-17 11:26:38,568 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 55 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-11-17 11:26:38,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 404 flow [2023-11-17 11:26:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-17 11:26:38,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-11-17 11:26:38,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-17 11:26:38,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-17 11:26:38,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:38,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-17 11:26:38,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:38,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:38,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:38,573 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 178 flow. Second operand 3 states and 117 transitions. [2023-11-17 11:26:38,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 404 flow [2023-11-17 11:26:38,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:38,580 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 206 flow [2023-11-17 11:26:38,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-11-17 11:26:38,581 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-17 11:26:38,581 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 206 flow [2023-11-17 11:26:38,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:38,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:38,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:38,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:26:38,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:38,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash -457689573, now seen corresponding path program 1 times [2023-11-17 11:26:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788016075] [2023-11-17 11:26:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:39,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:39,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788016075] [2023-11-17 11:26:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788016075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:26:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230639057] [2023-11-17 11:26:39,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:39,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:39,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:39,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 72 [2023-11-17 11:26:39,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:39,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:39,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 72 [2023-11-17 11:26:39,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:40,544 INFO L124 PetriNetUnfolderBase]: 10843/14920 cut-off events. [2023-11-17 11:26:40,544 INFO L125 PetriNetUnfolderBase]: For 11897/11897 co-relation queries the response was YES. [2023-11-17 11:26:40,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44501 conditions, 14920 events. 10843/14920 cut-off events. For 11897/11897 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 75727 event pairs, 3081 based on Foata normal form. 224/15144 useless extension candidates. Maximal degree in co-relation 44484. Up to 9996 conditions per place. [2023-11-17 11:26:40,654 INFO L140 encePairwiseOnDemand]: 61/72 looper letters, 48 selfloop transitions, 21 changer transitions 0/69 dead transitions. [2023-11-17 11:26:40,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 453 flow [2023-11-17 11:26:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2023-11-17 11:26:40,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513888888888889 [2023-11-17 11:26:40,656 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 130 transitions. [2023-11-17 11:26:40,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 130 transitions. [2023-11-17 11:26:40,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:40,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 130 transitions. [2023-11-17 11:26:40,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:40,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:40,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:40,658 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 206 flow. Second operand 4 states and 130 transitions. [2023-11-17 11:26:40,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 453 flow [2023-11-17 11:26:40,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:40,665 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 378 flow [2023-11-17 11:26:40,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2023-11-17 11:26:40,668 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-17 11:26:40,668 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 378 flow [2023-11-17 11:26:40,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:40,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:40,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:40,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:26:40,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:40,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200443, now seen corresponding path program 2 times [2023-11-17 11:26:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751665661] [2023-11-17 11:26:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:41,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751665661] [2023-11-17 11:26:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751665661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:41,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263689157] [2023-11-17 11:26:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:41,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:41,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:41,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:41,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:41,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:41,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:41,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:41,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:42,279 INFO L124 PetriNetUnfolderBase]: 9712/13689 cut-off events. [2023-11-17 11:26:42,279 INFO L125 PetriNetUnfolderBase]: For 23436/23436 co-relation queries the response was YES. [2023-11-17 11:26:42,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49737 conditions, 13689 events. 9712/13689 cut-off events. For 23436/23436 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 73989 event pairs, 1265 based on Foata normal form. 48/13580 useless extension candidates. Maximal degree in co-relation 49717. Up to 10565 conditions per place. [2023-11-17 11:26:42,390 INFO L140 encePairwiseOnDemand]: 68/72 looper letters, 89 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2023-11-17 11:26:42,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 862 flow [2023-11-17 11:26:42,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2023-11-17 11:26:42,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2023-11-17 11:26:42,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 155 transitions. [2023-11-17 11:26:42,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 155 transitions. [2023-11-17 11:26:42,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:42,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 155 transitions. [2023-11-17 11:26:42,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:42,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:42,394 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:42,394 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 378 flow. Second operand 4 states and 155 transitions. [2023-11-17 11:26:42,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 862 flow [2023-11-17 11:26:42,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 102 transitions, 861 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:42,406 INFO L231 Difference]: Finished difference. Result has 53 places, 55 transitions, 397 flow [2023-11-17 11:26:42,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=53, PETRI_TRANSITIONS=55} [2023-11-17 11:26:42,409 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-11-17 11:26:42,409 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 397 flow [2023-11-17 11:26:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:42,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:42,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:42,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:26:42,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:42,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -457515260, now seen corresponding path program 1 times [2023-11-17 11:26:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7835162] [2023-11-17 11:26:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7835162] [2023-11-17 11:26:42,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7835162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:42,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:42,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753232219] [2023-11-17 11:26:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:42,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:42,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:42,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:42,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 397 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:42,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:42,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:44,193 INFO L124 PetriNetUnfolderBase]: 9967/14056 cut-off events. [2023-11-17 11:26:44,193 INFO L125 PetriNetUnfolderBase]: For 27820/27820 co-relation queries the response was YES. [2023-11-17 11:26:44,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52523 conditions, 14056 events. 9967/14056 cut-off events. For 27820/27820 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 76562 event pairs, 1933 based on Foata normal form. 48/13914 useless extension candidates. Maximal degree in co-relation 52501. Up to 10970 conditions per place. [2023-11-17 11:26:44,327 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 88 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2023-11-17 11:26:44,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 107 transitions, 943 flow [2023-11-17 11:26:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-17 11:26:44,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-11-17 11:26:44,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-17 11:26:44,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-17 11:26:44,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:44,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-17 11:26:44,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:44,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:44,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:44,332 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 397 flow. Second operand 4 states and 156 transitions. [2023-11-17 11:26:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 107 transitions, 943 flow [2023-11-17 11:26:44,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 107 transitions, 929 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:44,350 INFO L231 Difference]: Finished difference. Result has 55 places, 63 transitions, 499 flow [2023-11-17 11:26:44,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=55, PETRI_TRANSITIONS=63} [2023-11-17 11:26:44,352 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-11-17 11:26:44,352 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 63 transitions, 499 flow [2023-11-17 11:26:44,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:44,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:44,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:44,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:26:44,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:44,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1298935200, now seen corresponding path program 1 times [2023-11-17 11:26:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914370339] [2023-11-17 11:26:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914370339] [2023-11-17 11:26:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914370339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:44,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739316253] [2023-11-17 11:26:44,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:44,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:44,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:44,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 63 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:44,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:44,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:44,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:46,034 INFO L124 PetriNetUnfolderBase]: 11747/16464 cut-off events. [2023-11-17 11:26:46,035 INFO L125 PetriNetUnfolderBase]: For 39375/39579 co-relation queries the response was YES. [2023-11-17 11:26:46,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64579 conditions, 16464 events. 11747/16464 cut-off events. For 39375/39579 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 88766 event pairs, 5663 based on Foata normal form. 36/16383 useless extension candidates. Maximal degree in co-relation 64556. Up to 12636 conditions per place. [2023-11-17 11:26:46,182 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 79 selfloop transitions, 32 changer transitions 0/117 dead transitions. [2023-11-17 11:26:46,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 117 transitions, 1091 flow [2023-11-17 11:26:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-17 11:26:46,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-11-17 11:26:46,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-17 11:26:46,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-17 11:26:46,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:46,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-17 11:26:46,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:46,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:46,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:46,187 INFO L175 Difference]: Start difference. First operand has 55 places, 63 transitions, 499 flow. Second operand 5 states and 182 transitions. [2023-11-17 11:26:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 117 transitions, 1091 flow [2023-11-17 11:26:46,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 1071 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:46,208 INFO L231 Difference]: Finished difference. Result has 59 places, 88 transitions, 824 flow [2023-11-17 11:26:46,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=59, PETRI_TRANSITIONS=88} [2023-11-17 11:26:46,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-11-17 11:26:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 88 transitions, 824 flow [2023-11-17 11:26:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:46,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:46,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:26:46,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1071412764, now seen corresponding path program 2 times [2023-11-17 11:26:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059505736] [2023-11-17 11:26:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059505736] [2023-11-17 11:26:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059505736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066903690] [2023-11-17 11:26:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:46,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:46,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:46,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 88 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:46,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:46,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:46,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:47,919 INFO L124 PetriNetUnfolderBase]: 11531/16266 cut-off events. [2023-11-17 11:26:47,919 INFO L125 PetriNetUnfolderBase]: For 53614/53614 co-relation queries the response was YES. [2023-11-17 11:26:47,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71011 conditions, 16266 events. 11531/16266 cut-off events. For 53614/53614 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 89583 event pairs, 1651 based on Foata normal form. 40/16231 useless extension candidates. Maximal degree in co-relation 70986. Up to 10752 conditions per place. [2023-11-17 11:26:48,056 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 102 selfloop transitions, 43 changer transitions 0/151 dead transitions. [2023-11-17 11:26:48,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 151 transitions, 1538 flow [2023-11-17 11:26:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2023-11-17 11:26:48,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2023-11-17 11:26:48,058 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 220 transitions. [2023-11-17 11:26:48,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 220 transitions. [2023-11-17 11:26:48,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:48,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 220 transitions. [2023-11-17 11:26:48,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:48,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:48,060 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:48,060 INFO L175 Difference]: Start difference. First operand has 59 places, 88 transitions, 824 flow. Second operand 6 states and 220 transitions. [2023-11-17 11:26:48,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 151 transitions, 1538 flow [2023-11-17 11:26:48,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 151 transitions, 1507 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:48,176 INFO L231 Difference]: Finished difference. Result has 63 places, 95 transitions, 948 flow [2023-11-17 11:26:48,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=948, PETRI_PLACES=63, PETRI_TRANSITIONS=95} [2023-11-17 11:26:48,177 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-11-17 11:26:48,177 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 95 transitions, 948 flow [2023-11-17 11:26:48,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:48,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:48,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:48,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:26:48,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:48,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1329985110, now seen corresponding path program 3 times [2023-11-17 11:26:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219879252] [2023-11-17 11:26:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219879252] [2023-11-17 11:26:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219879252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165075098] [2023-11-17 11:26:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:48,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:48,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:48,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:48,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 95 transitions, 948 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:48,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:48,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:48,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:50,100 INFO L124 PetriNetUnfolderBase]: 11711/16530 cut-off events. [2023-11-17 11:26:50,100 INFO L125 PetriNetUnfolderBase]: For 63384/63384 co-relation queries the response was YES. [2023-11-17 11:26:50,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75170 conditions, 16530 events. 11711/16530 cut-off events. For 63384/63384 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 91420 event pairs, 1831 based on Foata normal form. 24/16479 useless extension candidates. Maximal degree in co-relation 75144. Up to 12415 conditions per place. [2023-11-17 11:26:50,433 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 118 selfloop transitions, 35 changer transitions 0/159 dead transitions. [2023-11-17 11:26:50,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 159 transitions, 1709 flow [2023-11-17 11:26:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2023-11-17 11:26:50,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-11-17 11:26:50,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 194 transitions. [2023-11-17 11:26:50,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 194 transitions. [2023-11-17 11:26:50,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:50,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 194 transitions. [2023-11-17 11:26:50,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:50,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:50,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:50,438 INFO L175 Difference]: Start difference. First operand has 63 places, 95 transitions, 948 flow. Second operand 5 states and 194 transitions. [2023-11-17 11:26:50,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 159 transitions, 1709 flow [2023-11-17 11:26:50,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 159 transitions, 1704 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:50,649 INFO L231 Difference]: Finished difference. Result has 67 places, 104 transitions, 1155 flow [2023-11-17 11:26:50,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=67, PETRI_TRANSITIONS=104} [2023-11-17 11:26:50,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-11-17 11:26:50,650 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 104 transitions, 1155 flow [2023-11-17 11:26:50,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:50,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:50,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:50,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:26:50,651 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:50,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1330228770, now seen corresponding path program 4 times [2023-11-17 11:26:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619092729] [2023-11-17 11:26:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619092729] [2023-11-17 11:26:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619092729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303044557] [2023-11-17 11:26:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:51,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:51,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:51,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:51,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:51,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 104 transitions, 1155 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:51,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:51,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:51,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:53,054 INFO L124 PetriNetUnfolderBase]: 13312/18808 cut-off events. [2023-11-17 11:26:53,055 INFO L125 PetriNetUnfolderBase]: For 87298/87364 co-relation queries the response was YES. [2023-11-17 11:26:53,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88905 conditions, 18808 events. 13312/18808 cut-off events. For 87298/87364 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 106960 event pairs, 2003 based on Foata normal form. 116/18734 useless extension candidates. Maximal degree in co-relation 88877. Up to 11049 conditions per place. [2023-11-17 11:26:53,217 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 132 selfloop transitions, 76 changer transitions 0/214 dead transitions. [2023-11-17 11:26:53,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 214 transitions, 2523 flow [2023-11-17 11:26:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2023-11-17 11:26:53,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2023-11-17 11:26:53,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 236 transitions. [2023-11-17 11:26:53,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 236 transitions. [2023-11-17 11:26:53,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:53,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 236 transitions. [2023-11-17 11:26:53,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:53,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:53,221 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:53,221 INFO L175 Difference]: Start difference. First operand has 67 places, 104 transitions, 1155 flow. Second operand 6 states and 236 transitions. [2023-11-17 11:26:53,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 214 transitions, 2523 flow [2023-11-17 11:26:53,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 214 transitions, 2442 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:53,384 INFO L231 Difference]: Finished difference. Result has 70 places, 145 transitions, 1876 flow [2023-11-17 11:26:53,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1876, PETRI_PLACES=70, PETRI_TRANSITIONS=145} [2023-11-17 11:26:53,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-11-17 11:26:53,385 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 145 transitions, 1876 flow [2023-11-17 11:26:53,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:53,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:53,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:53,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:26:53,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:53,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1586771943, now seen corresponding path program 1 times [2023-11-17 11:26:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334730658] [2023-11-17 11:26:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:53,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334730658] [2023-11-17 11:26:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334730658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598911143] [2023-11-17 11:26:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:53,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:53,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:53,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:53,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:53,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 145 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:53,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:53,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:53,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:56,146 INFO L124 PetriNetUnfolderBase]: 14323/20287 cut-off events. [2023-11-17 11:26:56,146 INFO L125 PetriNetUnfolderBase]: For 115556/115622 co-relation queries the response was YES. [2023-11-17 11:26:56,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100977 conditions, 20287 events. 14323/20287 cut-off events. For 115556/115622 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 117551 event pairs, 2119 based on Foata normal form. 70/20166 useless extension candidates. Maximal degree in co-relation 100948. Up to 14821 conditions per place. [2023-11-17 11:26:56,310 INFO L140 encePairwiseOnDemand]: 64/72 looper letters, 162 selfloop transitions, 34 changer transitions 0/202 dead transitions. [2023-11-17 11:26:56,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 202 transitions, 2651 flow [2023-11-17 11:26:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2023-11-17 11:26:56,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-11-17 11:26:56,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 195 transitions. [2023-11-17 11:26:56,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 195 transitions. [2023-11-17 11:26:56,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:56,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 195 transitions. [2023-11-17 11:26:56,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:56,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:56,315 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:56,315 INFO L175 Difference]: Start difference. First operand has 70 places, 145 transitions, 1876 flow. Second operand 5 states and 195 transitions. [2023-11-17 11:26:56,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 202 transitions, 2651 flow [2023-11-17 11:26:56,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 202 transitions, 2585 flow, removed 33 selfloop flow, removed 0 redundant places. [2023-11-17 11:26:56,597 INFO L231 Difference]: Finished difference. Result has 75 places, 152 transitions, 2005 flow [2023-11-17 11:26:56,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2005, PETRI_PLACES=75, PETRI_TRANSITIONS=152} [2023-11-17 11:26:56,597 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-11-17 11:26:56,598 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 152 transitions, 2005 flow [2023-11-17 11:26:56,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:56,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:56,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:56,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:26:56,598 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:56,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1784087253, now seen corresponding path program 2 times [2023-11-17 11:26:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883470541] [2023-11-17 11:26:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:57,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883470541] [2023-11-17 11:26:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883470541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267669873] [2023-11-17 11:26:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:57,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:57,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:26:57,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 152 transitions, 2005 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:57,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:57,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:26:57,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:59,427 INFO L124 PetriNetUnfolderBase]: 14894/21104 cut-off events. [2023-11-17 11:26:59,428 INFO L125 PetriNetUnfolderBase]: For 133501/133567 co-relation queries the response was YES. [2023-11-17 11:26:59,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109141 conditions, 21104 events. 14894/21104 cut-off events. For 133501/133567 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 123136 event pairs, 2279 based on Foata normal form. 76/20929 useless extension candidates. Maximal degree in co-relation 109109. Up to 11219 conditions per place. [2023-11-17 11:26:59,579 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 138 selfloop transitions, 94 changer transitions 0/238 dead transitions. [2023-11-17 11:26:59,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 238 transitions, 3153 flow [2023-11-17 11:26:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 235 transitions. [2023-11-17 11:26:59,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5439814814814815 [2023-11-17 11:26:59,581 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 235 transitions. [2023-11-17 11:26:59,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 235 transitions. [2023-11-17 11:26:59,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:59,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 235 transitions. [2023-11-17 11:26:59,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:59,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:59,583 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:59,584 INFO L175 Difference]: Start difference. First operand has 75 places, 152 transitions, 2005 flow. Second operand 6 states and 235 transitions. [2023-11-17 11:26:59,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 238 transitions, 3153 flow [2023-11-17 11:26:59,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 238 transitions, 3092 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:59,881 INFO L231 Difference]: Finished difference. Result has 78 places, 167 transitions, 2444 flow [2023-11-17 11:26:59,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2444, PETRI_PLACES=78, PETRI_TRANSITIONS=167} [2023-11-17 11:26:59,882 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-11-17 11:26:59,882 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 167 transitions, 2444 flow [2023-11-17 11:26:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:59,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:59,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:59,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:26:59,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:59,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1585532253, now seen corresponding path program 3 times [2023-11-17 11:26:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997511041] [2023-11-17 11:26:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:00,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997511041] [2023-11-17 11:27:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997511041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928103515] [2023-11-17 11:27:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:00,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:00,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:27:00,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 167 transitions, 2444 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:00,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:00,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:27:00,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:02,834 INFO L124 PetriNetUnfolderBase]: 16391/23434 cut-off events. [2023-11-17 11:27:02,835 INFO L125 PetriNetUnfolderBase]: For 175212/175300 co-relation queries the response was YES. [2023-11-17 11:27:02,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122178 conditions, 23434 events. 16391/23434 cut-off events. For 175212/175300 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 141319 event pairs, 2513 based on Foata normal form. 168/23308 useless extension candidates. Maximal degree in co-relation 122145. Up to 10889 conditions per place. [2023-11-17 11:27:03,017 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 138 selfloop transitions, 76 changer transitions 0/220 dead transitions. [2023-11-17 11:27:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 220 transitions, 3324 flow [2023-11-17 11:27:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2023-11-17 11:27:03,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-11-17 11:27:03,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 183 transitions. [2023-11-17 11:27:03,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 183 transitions. [2023-11-17 11:27:03,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:03,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 183 transitions. [2023-11-17 11:27:03,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:03,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:03,021 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:03,021 INFO L175 Difference]: Start difference. First operand has 78 places, 167 transitions, 2444 flow. Second operand 5 states and 183 transitions. [2023-11-17 11:27:03,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 220 transitions, 3324 flow [2023-11-17 11:27:03,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 220 transitions, 3161 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-11-17 11:27:03,441 INFO L231 Difference]: Finished difference. Result has 79 places, 173 transitions, 2640 flow [2023-11-17 11:27:03,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2640, PETRI_PLACES=79, PETRI_TRANSITIONS=173} [2023-11-17 11:27:03,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2023-11-17 11:27:03,442 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 173 transitions, 2640 flow [2023-11-17 11:27:03,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:03,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:03,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:03,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:27:03,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:03,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1585525309, now seen corresponding path program 1 times [2023-11-17 11:27:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24038871] [2023-11-17 11:27:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:03,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24038871] [2023-11-17 11:27:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24038871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:03,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491036259] [2023-11-17 11:27:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:03,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 72 [2023-11-17 11:27:03,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 173 transitions, 2640 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:03,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:03,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 72 [2023-11-17 11:27:03,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:07,453 INFO L124 PetriNetUnfolderBase]: 23251/33140 cut-off events. [2023-11-17 11:27:07,454 INFO L125 PetriNetUnfolderBase]: For 271433/272791 co-relation queries the response was YES. [2023-11-17 11:27:07,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175621 conditions, 33140 events. 23251/33140 cut-off events. For 271433/272791 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 208428 event pairs, 4033 based on Foata normal form. 1364/34432 useless extension candidates. Maximal degree in co-relation 175588. Up to 15543 conditions per place. [2023-11-17 11:27:07,668 INFO L140 encePairwiseOnDemand]: 69/72 looper letters, 223 selfloop transitions, 4 changer transitions 114/350 dead transitions. [2023-11-17 11:27:07,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 350 transitions, 6096 flow [2023-11-17 11:27:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-17 11:27:07,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2023-11-17 11:27:07,670 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-17 11:27:07,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-17 11:27:07,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:07,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-17 11:27:07,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:07,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:07,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:07,672 INFO L175 Difference]: Start difference. First operand has 79 places, 173 transitions, 2640 flow. Second operand 4 states and 147 transitions. [2023-11-17 11:27:07,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 350 transitions, 6096 flow [2023-11-17 11:27:08,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 350 transitions, 5940 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-11-17 11:27:08,105 INFO L231 Difference]: Finished difference. Result has 81 places, 160 transitions, 2395 flow [2023-11-17 11:27:08,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2395, PETRI_PLACES=81, PETRI_TRANSITIONS=160} [2023-11-17 11:27:08,106 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2023-11-17 11:27:08,106 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 160 transitions, 2395 flow [2023-11-17 11:27:08,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:08,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:08,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:08,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:27:08,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:08,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1154253967, now seen corresponding path program 2 times [2023-11-17 11:27:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744870312] [2023-11-17 11:27:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744870312] [2023-11-17 11:27:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744870312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087763612] [2023-11-17 11:27:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:08,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:08,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:08,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2023-11-17 11:27:08,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 160 transitions, 2395 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:08,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:08,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2023-11-17 11:27:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:11,236 INFO L124 PetriNetUnfolderBase]: 17169/25542 cut-off events. [2023-11-17 11:27:11,237 INFO L125 PetriNetUnfolderBase]: For 238836/242238 co-relation queries the response was YES. [2023-11-17 11:27:11,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133115 conditions, 25542 events. 17169/25542 cut-off events. For 238836/242238 co-relation queries the response was YES. Maximal size of possible extension queue 1312. Compared 174506 event pairs, 1959 based on Foata normal form. 3559/28596 useless extension candidates. Maximal degree in co-relation 133081. Up to 11198 conditions per place. [2023-11-17 11:27:11,396 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 299 selfloop transitions, 6 changer transitions 2/321 dead transitions. [2023-11-17 11:27:11,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 321 transitions, 5444 flow [2023-11-17 11:27:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-17 11:27:11,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965277777777778 [2023-11-17 11:27:11,397 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-17 11:27:11,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-17 11:27:11,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:11,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-17 11:27:11,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:11,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:11,399 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:11,399 INFO L175 Difference]: Start difference. First operand has 81 places, 160 transitions, 2395 flow. Second operand 4 states and 143 transitions. [2023-11-17 11:27:11,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 321 transitions, 5444 flow [2023-11-17 11:27:11,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 321 transitions, 5397 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:11,662 INFO L231 Difference]: Finished difference. Result has 85 places, 153 transitions, 2223 flow [2023-11-17 11:27:11,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=2141, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2223, PETRI_PLACES=85, PETRI_TRANSITIONS=153} [2023-11-17 11:27:11,663 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2023-11-17 11:27:11,663 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 153 transitions, 2223 flow [2023-11-17 11:27:11,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:11,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:11,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:27:11,663 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:11,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -371922729, now seen corresponding path program 1 times [2023-11-17 11:27:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456942136] [2023-11-17 11:27:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:11,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:11,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456942136] [2023-11-17 11:27:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456942136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697930472] [2023-11-17 11:27:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:11,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:11,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2023-11-17 11:27:11,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 153 transitions, 2223 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:11,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:11,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2023-11-17 11:27:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:14,457 INFO L124 PetriNetUnfolderBase]: 13755/21027 cut-off events. [2023-11-17 11:27:14,457 INFO L125 PetriNetUnfolderBase]: For 211551/215788 co-relation queries the response was YES. [2023-11-17 11:27:14,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120248 conditions, 21027 events. 13755/21027 cut-off events. For 211551/215788 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 145906 event pairs, 1670 based on Foata normal form. 3068/23578 useless extension candidates. Maximal degree in co-relation 120211. Up to 8637 conditions per place. [2023-11-17 11:27:14,590 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 289 selfloop transitions, 10 changer transitions 4/317 dead transitions. [2023-11-17 11:27:14,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 317 transitions, 5181 flow [2023-11-17 11:27:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2023-11-17 11:27:14,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2023-11-17 11:27:14,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 182 transitions. [2023-11-17 11:27:14,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 182 transitions. [2023-11-17 11:27:14,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:14,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 182 transitions. [2023-11-17 11:27:14,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:14,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:14,593 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:14,594 INFO L175 Difference]: Start difference. First operand has 85 places, 153 transitions, 2223 flow. Second operand 5 states and 182 transitions. [2023-11-17 11:27:14,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 317 transitions, 5181 flow [2023-11-17 11:27:14,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 317 transitions, 5101 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:14,839 INFO L231 Difference]: Finished difference. Result has 86 places, 132 transitions, 1847 flow [2023-11-17 11:27:14,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1847, PETRI_PLACES=86, PETRI_TRANSITIONS=132} [2023-11-17 11:27:14,840 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2023-11-17 11:27:14,840 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 132 transitions, 1847 flow [2023-11-17 11:27:14,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:14,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:14,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:27:14,841 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:14,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 964344268, now seen corresponding path program 1 times [2023-11-17 11:27:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765594411] [2023-11-17 11:27:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765594411] [2023-11-17 11:27:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765594411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127348424] [2023-11-17 11:27:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:15,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:15,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:15,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 72 [2023-11-17 11:27:15,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 132 transitions, 1847 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:15,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:15,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 72 [2023-11-17 11:27:15,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:18,660 INFO L124 PetriNetUnfolderBase]: 20682/30918 cut-off events. [2023-11-17 11:27:18,660 INFO L125 PetriNetUnfolderBase]: For 241833/241833 co-relation queries the response was YES. [2023-11-17 11:27:18,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186365 conditions, 30918 events. 20682/30918 cut-off events. For 241833/241833 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 209504 event pairs, 4467 based on Foata normal form. 51/30969 useless extension candidates. Maximal degree in co-relation 186326. Up to 16063 conditions per place. [2023-11-17 11:27:18,835 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 127 selfloop transitions, 13 changer transitions 77/217 dead transitions. [2023-11-17 11:27:18,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 217 transitions, 3260 flow [2023-11-17 11:27:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:18,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2023-11-17 11:27:18,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2023-11-17 11:27:18,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2023-11-17 11:27:18,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2023-11-17 11:27:18,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:18,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2023-11-17 11:27:18,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:18,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:18,838 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:18,838 INFO L175 Difference]: Start difference. First operand has 86 places, 132 transitions, 1847 flow. Second operand 4 states and 141 transitions. [2023-11-17 11:27:18,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 217 transitions, 3260 flow [2023-11-17 11:27:19,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 217 transitions, 3232 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:19,301 INFO L231 Difference]: Finished difference. Result has 89 places, 105 transitions, 1375 flow [2023-11-17 11:27:19,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1375, PETRI_PLACES=89, PETRI_TRANSITIONS=105} [2023-11-17 11:27:19,301 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2023-11-17 11:27:19,301 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 105 transitions, 1375 flow [2023-11-17 11:27:19,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:19,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:19,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:19,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:27:19,302 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:19,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash -71486023, now seen corresponding path program 1 times [2023-11-17 11:27:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254319566] [2023-11-17 11:27:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:19,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:19,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254319566] [2023-11-17 11:27:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254319566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:19,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:27:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301432746] [2023-11-17 11:27:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:19,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:19,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:19,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2023-11-17 11:27:19,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 105 transitions, 1375 flow. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:19,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:19,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2023-11-17 11:27:19,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,844 INFO L124 PetriNetUnfolderBase]: 5389/8858 cut-off events. [2023-11-17 11:27:20,844 INFO L125 PetriNetUnfolderBase]: For 91216/92321 co-relation queries the response was YES. [2023-11-17 11:27:20,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53934 conditions, 8858 events. 5389/8858 cut-off events. For 91216/92321 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 59704 event pairs, 521 based on Foata normal form. 1229/9922 useless extension candidates. Maximal degree in co-relation 53893. Up to 3710 conditions per place. [2023-11-17 11:27:20,888 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 181 selfloop transitions, 14 changer transitions 35/241 dead transitions. [2023-11-17 11:27:20,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 241 transitions, 3583 flow [2023-11-17 11:27:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:27:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:27:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2023-11-17 11:27:20,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976851851851852 [2023-11-17 11:27:20,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 215 transitions. [2023-11-17 11:27:20,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 215 transitions. [2023-11-17 11:27:20,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 215 transitions. [2023-11-17 11:27:20,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:20,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:20,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:20,891 INFO L175 Difference]: Start difference. First operand has 89 places, 105 transitions, 1375 flow. Second operand 6 states and 215 transitions. [2023-11-17 11:27:20,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 241 transitions, 3583 flow [2023-11-17 11:27:21,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 3507 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-17 11:27:21,092 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 1173 flow [2023-11-17 11:27:21,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2023-11-17 11:27:21,093 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2023-11-17 11:27:21,093 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 1173 flow [2023-11-17 11:27:21,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:21,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:21,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:21,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 11:27:21,094 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:21,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1025264187, now seen corresponding path program 1 times [2023-11-17 11:27:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508317621] [2023-11-17 11:27:21,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:21,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508317621] [2023-11-17 11:27:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508317621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:27:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060817188] [2023-11-17 11:27:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:21,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:27:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:27:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:27:21,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 72 [2023-11-17 11:27:21,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 1173 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:21,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:21,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 72 [2023-11-17 11:27:21,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:22,377 INFO L124 PetriNetUnfolderBase]: 5046/8320 cut-off events. [2023-11-17 11:27:22,377 INFO L125 PetriNetUnfolderBase]: For 75659/76493 co-relation queries the response was YES. [2023-11-17 11:27:22,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51523 conditions, 8320 events. 5046/8320 cut-off events. For 75659/76493 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 56134 event pairs, 512 based on Foata normal form. 497/8655 useless extension candidates. Maximal degree in co-relation 51481. Up to 3489 conditions per place. [2023-11-17 11:27:22,414 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 138 selfloop transitions, 18 changer transitions 34/198 dead transitions. [2023-11-17 11:27:22,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 198 transitions, 2876 flow [2023-11-17 11:27:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:27:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:27:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-17 11:27:22,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-11-17 11:27:22,415 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-17 11:27:22,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-17 11:27:22,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:22,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-17 11:27:22,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:22,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:22,418 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 72.0) internal successors, (576), 8 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:22,418 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 1173 flow. Second operand 7 states and 225 transitions. [2023-11-17 11:27:22,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 198 transitions, 2876 flow [2023-11-17 11:27:22,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 198 transitions, 2784 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:22,638 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 970 flow [2023-11-17 11:27:22,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=970, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2023-11-17 11:27:22,639 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2023-11-17 11:27:22,639 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 970 flow [2023-11-17 11:27:22,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:22,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:22,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:22,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 11:27:22,640 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:22,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash 246480358, now seen corresponding path program 1 times [2023-11-17 11:27:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086026936] [2023-11-17 11:27:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086026936] [2023-11-17 11:27:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086026936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:22,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614035966] [2023-11-17 11:27:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:22,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:22,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 72 [2023-11-17 11:27:22,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 970 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:22,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:22,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 72 [2023-11-17 11:27:22,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:23,276 INFO L124 PetriNetUnfolderBase]: 1833/3102 cut-off events. [2023-11-17 11:27:23,276 INFO L125 PetriNetUnfolderBase]: For 21139/21232 co-relation queries the response was YES. [2023-11-17 11:27:23,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18548 conditions, 3102 events. 1833/3102 cut-off events. For 21139/21232 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17270 event pairs, 382 based on Foata normal form. 81/3168 useless extension candidates. Maximal degree in co-relation 18515. Up to 1994 conditions per place. [2023-11-17 11:27:23,290 INFO L140 encePairwiseOnDemand]: 69/72 looper letters, 53 selfloop transitions, 1 changer transitions 95/152 dead transitions. [2023-11-17 11:27:23,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 152 transitions, 2081 flow [2023-11-17 11:27:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-11-17 11:27:23,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2023-11-17 11:27:23,292 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 149 transitions. [2023-11-17 11:27:23,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 149 transitions. [2023-11-17 11:27:23,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:23,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 149 transitions. [2023-11-17 11:27:23,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:23,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:23,294 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:23,294 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 970 flow. Second operand 4 states and 149 transitions. [2023-11-17 11:27:23,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 152 transitions, 2081 flow [2023-11-17 11:27:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 152 transitions, 1912 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-11-17 11:27:23,345 INFO L231 Difference]: Finished difference. Result has 89 places, 53 transitions, 522 flow [2023-11-17 11:27:23,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=522, PETRI_PLACES=89, PETRI_TRANSITIONS=53} [2023-11-17 11:27:23,346 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2023-11-17 11:27:23,346 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 53 transitions, 522 flow [2023-11-17 11:27:23,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:23,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:23,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:23,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-17 11:27:23,349 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:23,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash 152643020, now seen corresponding path program 2 times [2023-11-17 11:27:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644957791] [2023-11-17 11:27:23,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:27:24,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644957791] [2023-11-17 11:27:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644957791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:24,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:24,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:27:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428418103] [2023-11-17 11:27:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:24,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:27:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:27:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:27:24,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 72 [2023-11-17 11:27:24,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 53 transitions, 522 flow. Second operand has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 7 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:24,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 72 [2023-11-17 11:27:24,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:24,491 INFO L124 PetriNetUnfolderBase]: 378/681 cut-off events. [2023-11-17 11:27:24,491 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2023-11-17 11:27:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 681 events. 378/681 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2732 event pairs, 61 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 3859. Up to 338 conditions per place. [2023-11-17 11:27:24,494 INFO L140 encePairwiseOnDemand]: 67/72 looper letters, 54 selfloop transitions, 6 changer transitions 23/85 dead transitions. [2023-11-17 11:27:24,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 913 flow [2023-11-17 11:27:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2023-11-17 11:27:24,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-17 11:27:24,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 171 transitions. [2023-11-17 11:27:24,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 171 transitions. [2023-11-17 11:27:24,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:24,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 171 transitions. [2023-11-17 11:27:24,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,498 INFO L175 Difference]: Start difference. First operand has 89 places, 53 transitions, 522 flow. Second operand 5 states and 171 transitions. [2023-11-17 11:27:24,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 913 flow [2023-11-17 11:27:24,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 85 transitions, 652 flow, removed 32 selfloop flow, removed 25 redundant places. [2023-11-17 11:27:24,509 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 335 flow [2023-11-17 11:27:24,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-11-17 11:27:24,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-11-17 11:27:24,512 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 335 flow [2023-11-17 11:27:24,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.571428571428573) internal successors, (200), 7 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:24,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:24,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-17 11:27:24,512 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:24,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -841317056, now seen corresponding path program 3 times [2023-11-17 11:27:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602846092] [2023-11-17 11:27:24,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:24,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:27:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:24,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:27:24,650 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:27:24,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:27:24,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:27:24,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:27:24,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:27:24,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:27:24,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:27:24,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:27:24,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 11:27:24,656 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:24,661 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:27:24,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:27:24,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:27:24,748 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:27:24,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:27:24,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:27:24,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:27:24 BasicIcfg [2023-11-17 11:27:24,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:27:24,792 INFO L158 Benchmark]: Toolchain (without parser) took 56428.37ms. Allocated memory was 201.3MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 149.1MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-11-17 11:27:24,792 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:24,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.74ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 125.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:24,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.34ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 122.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:24,792 INFO L158 Benchmark]: Boogie Preprocessor took 54.42ms. Allocated memory is still 201.3MB. Free memory was 122.2MB in the beginning and 120.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:27:24,793 INFO L158 Benchmark]: RCFGBuilder took 828.77ms. Allocated memory was 201.3MB in the beginning and 305.1MB in the end (delta: 103.8MB). Free memory was 120.1MB in the beginning and 227.9MB in the end (delta: -107.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-11-17 11:27:24,793 INFO L158 Benchmark]: TraceAbstraction took 54930.90ms. Allocated memory was 305.1MB in the beginning and 6.6GB in the end (delta: 6.3GB). Free memory was 227.3MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-11-17 11:27:24,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 544.74ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 125.2MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.34ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 122.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.42ms. Allocated memory is still 201.3MB. Free memory was 122.2MB in the beginning and 120.4MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 828.77ms. Allocated memory was 201.3MB in the beginning and 305.1MB in the end (delta: 103.8MB). Free memory was 120.1MB in the beginning and 227.9MB in the end (delta: -107.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 54930.90ms. Allocated memory was 305.1MB in the beginning and 6.6GB in the end (delta: 6.3GB). Free memory was 227.3MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 58 PlacesBefore, 42 PlacesAfterwards, 46 TransitionsBefore, 29 TransitionsAfterwards, 1286 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 22 TotalNumberOfCompositions, 3149 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1581, independent: 1472, independent conditional: 0, independent unconditional: 1472, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, independent: 831, independent conditional: 0, independent unconditional: 831, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1581, independent: 623, independent conditional: 0, independent unconditional: 623, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1084; [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L820] 4 a = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 54.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 43.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 932 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2126 IncrementalHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 30 mSDtfsCounter, 2126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2640occurred in iteration=14, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 354 ConstructedInterpolants, 0 QuantifiedInterpolants, 3066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:27:24,823 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 0 Received shutdown request...