/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:15:20,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:15:20,812 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 15:15:20,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:15:20,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:15:20,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:15:20,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:15:20,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:15:20,846 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:15:20,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:15:20,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:15:20,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:15:20,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:15:20,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:15:20,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:15:20,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:15:20,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:15:20,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:15:20,853 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:15:20,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:15:20,854 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:15:20,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:15:20,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:15:20,855 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:15:20,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:15:20,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:20,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:15:20,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:15:20,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:15:20,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:15:20,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:15:20,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:15:20,858 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 [2023-11-17 15:15:21,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:15:21,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:15:21,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:15:21,148 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:15:21,148 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:15:21,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-11-17 15:15:22,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:15:22,710 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:15:22,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-11-17 15:15:22,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d22dd492/378fb9adf73b4f44910fd3325eb4ad28/FLAGb36f427e6 [2023-11-17 15:15:22,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d22dd492/378fb9adf73b4f44910fd3325eb4ad28 [2023-11-17 15:15:22,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:15:22,748 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:15:22,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:22,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:15:22,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:15:22,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:22" (1/1) ... [2023-11-17 15:15:22,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb83f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:22, skipping insertion in model container [2023-11-17 15:15:22,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:15:22" (1/1) ... [2023-11-17 15:15:22,822 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:15:22,971 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/mix039.opt.i[944,957] [2023-11-17 15:15:23,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:23,184 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:15:23,194 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/mix039.opt.i[944,957] [2023-11-17 15:15:23,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:15:23,275 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:23,276 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:15:23,281 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:15:23,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23 WrapperNode [2023-11-17 15:15:23,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:15:23,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:23,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:15:23,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:15:23,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,324 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-17 15:15:23,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:15:23,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:15:23,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:15:23,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:15:23,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:15:23,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:15:23,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:15:23,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:15:23,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (1/1) ... [2023-11-17 15:15:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:15:23,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:15:23,412 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 15:15:23,414 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 15:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:15:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:15:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:15:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:15:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:15:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:15:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:15:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:15:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:15:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:15:23,447 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 15:15:23,577 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:15:23,580 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:15:23,974 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:15:24,066 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:15:24,067 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:15:24,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:24 BoogieIcfgContainer [2023-11-17 15:15:24,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:15:24,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:15:24,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:15:24,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:15:24,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:15:22" (1/3) ... [2023-11-17 15:15:24,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418fd076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:24, skipping insertion in model container [2023-11-17 15:15:24,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:15:23" (2/3) ... [2023-11-17 15:15:24,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418fd076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:15:24, skipping insertion in model container [2023-11-17 15:15:24,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:15:24" (3/3) ... [2023-11-17 15:15:24,104 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-11-17 15:15:24,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:15:24,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:15:24,137 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:15:24,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:15:24,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 288 flow [2023-11-17 15:15:24,302 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-17 15:15:24,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:24,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:15:24,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 288 flow [2023-11-17 15:15:24,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2023-11-17 15:15:24,324 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:15:24,340 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-17 15:15:24,347 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2023-11-17 15:15:24,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2023-11-17 15:15:24,388 INFO L124 PetriNetUnfolderBase]: 2/132 cut-off events. [2023-11-17 15:15:24,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:24,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:15:24,394 INFO L119 LiptonReduction]: Number of co-enabled transitions 3472 [2023-11-17 15:15:28,979 INFO L134 LiptonReduction]: Checked pairs total: 7169 [2023-11-17 15:15:28,980 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-11-17 15:15:28,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:15:28,999 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;@28c5afee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:15:29,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:15:29,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:15:29,005 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-11-17 15:15:29,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:15:29,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:29,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:29,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:29,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1344528073, now seen corresponding path program 1 times [2023-11-17 15:15:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65053278] [2023-11-17 15:15:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:29,418 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 15:15:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65053278] [2023-11-17 15:15:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65053278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:29,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542529006] [2023-11-17 15:15:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:29,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:29,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:29,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 255 [2023-11-17 15:15:29,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 15:15:29,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:29,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 255 [2023-11-17 15:15:29,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:29,979 INFO L124 PetriNetUnfolderBase]: 2594/3779 cut-off events. [2023-11-17 15:15:29,980 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-17 15:15:29,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3779 events. 2594/3779 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19620 event pairs, 518 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 7462. Up to 2797 conditions per place. [2023-11-17 15:15:30,009 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-17 15:15:30,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-11-17 15:15:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-17 15:15:30,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530718954248366 [2023-11-17 15:15:30,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-17 15:15:30,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-17 15:15:30,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:30,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-17 15:15:30,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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 15:15:30,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:30,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:30,045 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 406 transitions. [2023-11-17 15:15:30,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-11-17 15:15:30,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:30,051 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-11-17 15:15:30,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 15:15:30,056 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-11-17 15:15:30,056 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-11-17 15:15:30,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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 15:15:30,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:30,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:30,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:15:30,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:30,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash -693628952, now seen corresponding path program 1 times [2023-11-17 15:15:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409415698] [2023-11-17 15:15:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:30,287 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 15:15:30,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:30,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409415698] [2023-11-17 15:15:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409415698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220659778] [2023-11-17 15:15:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:30,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:30,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:30,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2023-11-17 15:15:30,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 15:15:30,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:30,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2023-11-17 15:15:30,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:31,150 INFO L124 PetriNetUnfolderBase]: 6447/8936 cut-off events. [2023-11-17 15:15:31,151 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-11-17 15:15:31,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 8936 events. 6447/8936 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 43466 event pairs, 2195 based on Foata normal form. 200/9136 useless extension candidates. Maximal degree in co-relation 18460. Up to 6533 conditions per place. [2023-11-17 15:15:31,209 INFO L140 encePairwiseOnDemand]: 247/255 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-11-17 15:15:31,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 208 flow [2023-11-17 15:15:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-17 15:15:31,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2023-11-17 15:15:31,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-17 15:15:31,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-17 15:15:31,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:31,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-17 15:15:31,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 15:15:31,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:31,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:31,216 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 387 transitions. [2023-11-17 15:15:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 208 flow [2023-11-17 15:15:31,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:31,223 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2023-11-17 15:15:31,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-11-17 15:15:31,224 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-17 15:15:31,225 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2023-11-17 15:15:31,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 15:15:31,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:31,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:31,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:15:31,229 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:31,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -27662447, now seen corresponding path program 1 times [2023-11-17 15:15:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015032394] [2023-11-17 15:15:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015032394] [2023-11-17 15:15:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015032394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:31,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:15:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162306627] [2023-11-17 15:15:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:31,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-11-17 15:15:31,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 15:15:31,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:31,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-11-17 15:15:31,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:32,038 INFO L124 PetriNetUnfolderBase]: 4462/6525 cut-off events. [2023-11-17 15:15:32,039 INFO L125 PetriNetUnfolderBase]: For 2293/2328 co-relation queries the response was YES. [2023-11-17 15:15:32,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15685 conditions, 6525 events. 4462/6525 cut-off events. For 2293/2328 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 34562 event pairs, 1501 based on Foata normal form. 110/6575 useless extension candidates. Maximal degree in co-relation 15673. Up to 3941 conditions per place. [2023-11-17 15:15:32,091 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 33 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-11-17 15:15:32,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 218 flow [2023-11-17 15:15:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-11-17 15:15:32,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163398692810458 [2023-11-17 15:15:32,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-11-17 15:15:32,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-11-17 15:15:32,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:32,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-11-17 15:15:32,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 15:15:32,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:32,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:32,098 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 3 states and 395 transitions. [2023-11-17 15:15:32,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 218 flow [2023-11-17 15:15:32,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:32,111 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 109 flow [2023-11-17 15:15:32,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-17 15:15:32,112 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-17 15:15:32,112 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 109 flow [2023-11-17 15:15:32,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 15:15:32,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:32,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:32,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:15:32,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:32,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash -888398888, now seen corresponding path program 1 times [2023-11-17 15:15:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210544740] [2023-11-17 15:15:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:32,249 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 15:15:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:32,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210544740] [2023-11-17 15:15:32,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210544740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:32,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:32,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550024238] [2023-11-17 15:15:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:32,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:32,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2023-11-17 15:15:32,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 15:15:32,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:32,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2023-11-17 15:15:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:32,971 INFO L124 PetriNetUnfolderBase]: 5807/8064 cut-off events. [2023-11-17 15:15:32,972 INFO L125 PetriNetUnfolderBase]: For 1930/1930 co-relation queries the response was YES. [2023-11-17 15:15:32,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19999 conditions, 8064 events. 5807/8064 cut-off events. For 1930/1930 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 38587 event pairs, 951 based on Foata normal form. 32/8096 useless extension candidates. Maximal degree in co-relation 19986. Up to 5461 conditions per place. [2023-11-17 15:15:33,022 INFO L140 encePairwiseOnDemand]: 247/255 looper letters, 53 selfloop transitions, 11 changer transitions 0/64 dead transitions. [2023-11-17 15:15:33,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 64 transitions, 333 flow [2023-11-17 15:15:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:15:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:15:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-11-17 15:15:33,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029411764705882 [2023-11-17 15:15:33,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-11-17 15:15:33,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-11-17 15:15:33,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:33,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-11-17 15:15:33,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 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 15:15:33,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 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 15:15:33,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 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 15:15:33,028 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 109 flow. Second operand 4 states and 513 transitions. [2023-11-17 15:15:33,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 64 transitions, 333 flow [2023-11-17 15:15:33,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:15:33,031 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 167 flow [2023-11-17 15:15:33,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-17 15:15:33,032 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-11-17 15:15:33,032 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 167 flow [2023-11-17 15:15:33,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 15:15:33,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:33,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:33,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:15:33,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:33,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1770532477, now seen corresponding path program 1 times [2023-11-17 15:15:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283672683] [2023-11-17 15:15:33,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:33,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:33,156 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 15:15:33,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:33,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283672683] [2023-11-17 15:15:33,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283672683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:33,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:33,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:33,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562282003] [2023-11-17 15:15:33,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:33,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:33,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-11-17 15:15:33,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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 15:15:33,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:33,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-11-17 15:15:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:33,804 INFO L124 PetriNetUnfolderBase]: 4089/6073 cut-off events. [2023-11-17 15:15:33,805 INFO L125 PetriNetUnfolderBase]: For 3566/3823 co-relation queries the response was YES. [2023-11-17 15:15:33,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16172 conditions, 6073 events. 4089/6073 cut-off events. For 3566/3823 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 34353 event pairs, 732 based on Foata normal form. 582/6512 useless extension candidates. Maximal degree in co-relation 16157. Up to 4020 conditions per place. [2023-11-17 15:15:33,844 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 72 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2023-11-17 15:15:33,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 90 transitions, 545 flow [2023-11-17 15:15:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-11-17 15:15:33,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011764705882353 [2023-11-17 15:15:33,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-11-17 15:15:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-11-17 15:15:33,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:33,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-11-17 15:15:33,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 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 15:15:33,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 15:15:33,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 15:15:33,852 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 167 flow. Second operand 5 states and 639 transitions. [2023-11-17 15:15:33,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 90 transitions, 545 flow [2023-11-17 15:15:33,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 90 transitions, 545 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:15:33,858 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 242 flow [2023-11-17 15:15:33,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-11-17 15:15:33,859 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-11-17 15:15:33,859 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 242 flow [2023-11-17 15:15:33,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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 15:15:33,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:33,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:33,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:15:33,860 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:33,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1168114556, now seen corresponding path program 1 times [2023-11-17 15:15:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175109973] [2023-11-17 15:15:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:33,978 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 15:15:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:33,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175109973] [2023-11-17 15:15:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175109973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:33,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:33,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:15:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8444508] [2023-11-17 15:15:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:15:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:15:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:15:33,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2023-11-17 15:15:33,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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 15:15:33,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:33,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2023-11-17 15:15:33,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:34,931 INFO L124 PetriNetUnfolderBase]: 5579/8404 cut-off events. [2023-11-17 15:15:34,931 INFO L125 PetriNetUnfolderBase]: For 9909/9955 co-relation queries the response was YES. [2023-11-17 15:15:34,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29034 conditions, 8404 events. 5579/8404 cut-off events. For 9909/9955 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 49510 event pairs, 2273 based on Foata normal form. 111/8362 useless extension candidates. Maximal degree in co-relation 29014. Up to 4045 conditions per place. [2023-11-17 15:15:34,985 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 52 selfloop transitions, 5 changer transitions 7/69 dead transitions. [2023-11-17 15:15:34,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 481 flow [2023-11-17 15:15:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:15:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:15:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-17 15:15:34,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228758169934641 [2023-11-17 15:15:34,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-17 15:15:34,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-17 15:15:34,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:34,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-17 15:15:34,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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 15:15:34,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:34,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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 15:15:34,991 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 242 flow. Second operand 3 states and 400 transitions. [2023-11-17 15:15:34,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 481 flow [2023-11-17 15:15:35,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:35,015 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 242 flow [2023-11-17 15:15:35,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-11-17 15:15:35,017 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-17 15:15:35,018 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 242 flow [2023-11-17 15:15:35,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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 15:15:35,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:35,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:35,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:15:35,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:35,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:35,019 INFO L85 PathProgramCache]: Analyzing trace with hash -931107050, now seen corresponding path program 1 times [2023-11-17 15:15:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704503284] [2023-11-17 15:15:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:35,225 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 15:15:35,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:35,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704503284] [2023-11-17 15:15:35,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704503284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:35,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:35,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395318985] [2023-11-17 15:15:35,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:35,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:35,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:35,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:35,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-11-17 15:15:35,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 15:15:35,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:35,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-11-17 15:15:35,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:35,941 INFO L124 PetriNetUnfolderBase]: 3826/6018 cut-off events. [2023-11-17 15:15:35,941 INFO L125 PetriNetUnfolderBase]: For 6863/7212 co-relation queries the response was YES. [2023-11-17 15:15:35,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20877 conditions, 6018 events. 3826/6018 cut-off events. For 6863/7212 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 37480 event pairs, 341 based on Foata normal form. 599/6510 useless extension candidates. Maximal degree in co-relation 20856. Up to 2383 conditions per place. [2023-11-17 15:15:35,999 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 97 selfloop transitions, 17 changer transitions 1/123 dead transitions. [2023-11-17 15:15:35,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 123 transitions, 882 flow [2023-11-17 15:15:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-11-17 15:15:36,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008403361344538 [2023-11-17 15:15:36,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-11-17 15:15:36,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-11-17 15:15:36,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:36,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-11-17 15:15:36,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 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 15:15:36,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 15:15:36,008 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 15:15:36,008 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 242 flow. Second operand 7 states and 894 transitions. [2023-11-17 15:15:36,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 123 transitions, 882 flow [2023-11-17 15:15:36,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 123 transitions, 855 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 15:15:36,025 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 363 flow [2023-11-17 15:15:36,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-17 15:15:36,025 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-11-17 15:15:36,025 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 363 flow [2023-11-17 15:15:36,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 15:15:36,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:36,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:36,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:15:36,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:36,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash -512513319, now seen corresponding path program 1 times [2023-11-17 15:15:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788847449] [2023-11-17 15:15:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:15:36,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:36,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788847449] [2023-11-17 15:15:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788847449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:15:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528967408] [2023-11-17 15:15:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:36,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:15:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:15:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:15:36,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-11-17 15:15:36,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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 15:15:36,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:36,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-11-17 15:15:36,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:36,938 INFO L124 PetriNetUnfolderBase]: 3448/5460 cut-off events. [2023-11-17 15:15:36,938 INFO L125 PetriNetUnfolderBase]: For 10851/11318 co-relation queries the response was YES. [2023-11-17 15:15:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22462 conditions, 5460 events. 3448/5460 cut-off events. For 10851/11318 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 33899 event pairs, 231 based on Foata normal form. 417/5781 useless extension candidates. Maximal degree in co-relation 22437. Up to 2236 conditions per place. [2023-11-17 15:15:36,974 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 108 selfloop transitions, 26 changer transitions 12/154 dead transitions. [2023-11-17 15:15:36,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 154 transitions, 1195 flow [2023-11-17 15:15:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:15:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:15:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1149 transitions. [2023-11-17 15:15:36,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006535947712418 [2023-11-17 15:15:36,980 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1149 transitions. [2023-11-17 15:15:36,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1149 transitions. [2023-11-17 15:15:36,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:36,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1149 transitions. [2023-11-17 15:15:36,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.66666666666667) internal successors, (1149), 9 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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 15:15:36,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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 15:15:36,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 255.0) internal successors, (2550), 10 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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 15:15:36,986 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 363 flow. Second operand 9 states and 1149 transitions. [2023-11-17 15:15:36,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 154 transitions, 1195 flow [2023-11-17 15:15:37,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 154 transitions, 1134 flow, removed 18 selfloop flow, removed 4 redundant places. [2023-11-17 15:15:37,164 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 482 flow [2023-11-17 15:15:37,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-11-17 15:15:37,165 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-11-17 15:15:37,165 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 482 flow [2023-11-17 15:15:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 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 15:15:37,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:37,166 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] [2023-11-17 15:15:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:15:37,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:37,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 576487915, now seen corresponding path program 1 times [2023-11-17 15:15:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:37,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252879198] [2023-11-17 15:15:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:37,396 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 15:15:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:37,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252879198] [2023-11-17 15:15:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252879198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:37,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735166659] [2023-11-17 15:15:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:15:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:15:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:15:37,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2023-11-17 15:15:37,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 482 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 15:15:37,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:37,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2023-11-17 15:15:37,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:38,166 INFO L124 PetriNetUnfolderBase]: 3375/5332 cut-off events. [2023-11-17 15:15:38,166 INFO L125 PetriNetUnfolderBase]: For 13142/13459 co-relation queries the response was YES. [2023-11-17 15:15:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22143 conditions, 5332 events. 3375/5332 cut-off events. For 13142/13459 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 33131 event pairs, 223 based on Foata normal form. 221/5458 useless extension candidates. Maximal degree in co-relation 22116. Up to 1355 conditions per place. [2023-11-17 15:15:38,202 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 85 selfloop transitions, 30 changer transitions 33/155 dead transitions. [2023-11-17 15:15:38,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 155 transitions, 1240 flow [2023-11-17 15:15:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 15:15:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 15:15:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1380 transitions. [2023-11-17 15:15:38,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919786096256685 [2023-11-17 15:15:38,207 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1380 transitions. [2023-11-17 15:15:38,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1380 transitions. [2023-11-17 15:15:38,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:38,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1380 transitions. [2023-11-17 15:15:38,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.45454545454545) internal successors, (1380), 11 states have internal predecessors, (1380), 0 states have call successors, (0), 0 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 15:15:38,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 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 15:15:38,216 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 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 15:15:38,217 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 482 flow. Second operand 11 states and 1380 transitions. [2023-11-17 15:15:38,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 155 transitions, 1240 flow [2023-11-17 15:15:38,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 1126 flow, removed 35 selfloop flow, removed 5 redundant places. [2023-11-17 15:15:38,573 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 436 flow [2023-11-17 15:15:38,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=436, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-11-17 15:15:38,575 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-11-17 15:15:38,575 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 436 flow [2023-11-17 15:15:38,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 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 15:15:38,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:38,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:38,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:15:38,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:38,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 929035731, now seen corresponding path program 1 times [2023-11-17 15:15:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897875322] [2023-11-17 15:15:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:38,829 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 15:15:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897875322] [2023-11-17 15:15:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897875322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:15:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562485253] [2023-11-17 15:15:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:38,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:15:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:38,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:15:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:15:38,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 255 [2023-11-17 15:15:38,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 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 15:15:38,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:38,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 255 [2023-11-17 15:15:38,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:39,301 INFO L124 PetriNetUnfolderBase]: 2080/3271 cut-off events. [2023-11-17 15:15:39,301 INFO L125 PetriNetUnfolderBase]: For 8957/8957 co-relation queries the response was YES. [2023-11-17 15:15:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13330 conditions, 3271 events. 2080/3271 cut-off events. For 8957/8957 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16867 event pairs, 220 based on Foata normal form. 1/3272 useless extension candidates. Maximal degree in co-relation 13300. Up to 1918 conditions per place. [2023-11-17 15:15:39,319 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 89 selfloop transitions, 18 changer transitions 50/157 dead transitions. [2023-11-17 15:15:39,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 157 transitions, 1478 flow [2023-11-17 15:15:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:15:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:15:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-11-17 15:15:39,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964705882352941 [2023-11-17 15:15:39,322 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-11-17 15:15:39,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-11-17 15:15:39,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:39,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-11-17 15:15:39,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:39,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 15:15:39,326 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 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 15:15:39,326 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 436 flow. Second operand 5 states and 633 transitions. [2023-11-17 15:15:39,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 157 transitions, 1478 flow [2023-11-17 15:15:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 157 transitions, 1177 flow, removed 55 selfloop flow, removed 13 redundant places. [2023-11-17 15:15:39,377 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 359 flow [2023-11-17 15:15:39,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-17 15:15:39,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-11-17 15:15:39,378 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 359 flow [2023-11-17 15:15:39,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 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 15:15:39,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:39,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:15:39,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:39,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash -724745035, now seen corresponding path program 2 times [2023-11-17 15:15:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937443840] [2023-11-17 15:15:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:39,555 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 15:15:39,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:39,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937443840] [2023-11-17 15:15:39,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937443840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:39,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436154903] [2023-11-17 15:15:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:39,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:39,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:39,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 255 [2023-11-17 15:15:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 359 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 15:15:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 255 [2023-11-17 15:15:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:39,830 INFO L124 PetriNetUnfolderBase]: 1029/1639 cut-off events. [2023-11-17 15:15:39,830 INFO L125 PetriNetUnfolderBase]: For 3450/3450 co-relation queries the response was YES. [2023-11-17 15:15:39,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 1639 events. 1029/1639 cut-off events. For 3450/3450 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7249 event pairs, 124 based on Foata normal form. 1/1640 useless extension candidates. Maximal degree in co-relation 6405. Up to 751 conditions per place. [2023-11-17 15:15:39,839 INFO L140 encePairwiseOnDemand]: 247/255 looper letters, 67 selfloop transitions, 11 changer transitions 52/130 dead transitions. [2023-11-17 15:15:39,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 130 transitions, 1002 flow [2023-11-17 15:15:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:15:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:15:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-11-17 15:15:39,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-11-17 15:15:39,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-11-17 15:15:39,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-11-17 15:15:39,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:39,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-11-17 15:15:39,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:15:39,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 15:15:39,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 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 15:15:39,848 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 359 flow. Second operand 6 states and 750 transitions. [2023-11-17 15:15:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 130 transitions, 1002 flow [2023-11-17 15:15:39,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 978 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:39,865 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 291 flow [2023-11-17 15:15:39,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-11-17 15:15:39,866 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-11-17 15:15:39,866 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 291 flow [2023-11-17 15:15:39,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 15:15:39,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:39,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:39,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:15:39,867 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:39,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1760097811, now seen corresponding path program 3 times [2023-11-17 15:15:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636078314] [2023-11-17 15:15:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:40,285 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 15:15:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636078314] [2023-11-17 15:15:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636078314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:15:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665255624] [2023-11-17 15:15:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:15:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:15:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:15:40,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 255 [2023-11-17 15:15:40,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 0 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 15:15:40,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:40,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 255 [2023-11-17 15:15:40,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:40,698 INFO L124 PetriNetUnfolderBase]: 908/1472 cut-off events. [2023-11-17 15:15:40,698 INFO L125 PetriNetUnfolderBase]: For 3971/3971 co-relation queries the response was YES. [2023-11-17 15:15:40,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5932 conditions, 1472 events. 908/1472 cut-off events. For 3971/3971 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6519 event pairs, 45 based on Foata normal form. 1/1473 useless extension candidates. Maximal degree in co-relation 5914. Up to 457 conditions per place. [2023-11-17 15:15:40,704 INFO L140 encePairwiseOnDemand]: 244/255 looper letters, 46 selfloop transitions, 6 changer transitions 116/168 dead transitions. [2023-11-17 15:15:40,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 168 transitions, 1387 flow [2023-11-17 15:15:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 15:15:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 15:15:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1503 transitions. [2023-11-17 15:15:40,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45339366515837104 [2023-11-17 15:15:40,710 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1503 transitions. [2023-11-17 15:15:40,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1503 transitions. [2023-11-17 15:15:40,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:40,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1503 transitions. [2023-11-17 15:15:40,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.61538461538461) internal successors, (1503), 13 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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 15:15:40,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 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 15:15:40,719 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 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 15:15:40,720 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 291 flow. Second operand 13 states and 1503 transitions. [2023-11-17 15:15:40,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 168 transitions, 1387 flow [2023-11-17 15:15:40,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 168 transitions, 1297 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-17 15:15:40,734 INFO L231 Difference]: Finished difference. Result has 71 places, 37 transitions, 224 flow [2023-11-17 15:15:40,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=224, PETRI_PLACES=71, PETRI_TRANSITIONS=37} [2023-11-17 15:15:40,734 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-11-17 15:15:40,734 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 37 transitions, 224 flow [2023-11-17 15:15:40,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 0 states have call successors, (0), 0 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 15:15:40,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:40,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:15:40,735 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:40,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1369154871, now seen corresponding path program 4 times [2023-11-17 15:15:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040335034] [2023-11-17 15:15:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:15:41,067 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 15:15:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:15:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040335034] [2023-11-17 15:15:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040335034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:15:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:15:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:15:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285662926] [2023-11-17 15:15:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:15:41,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:15:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:15:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:15:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:15:41,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2023-11-17 15:15:41,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 37 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 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 15:15:41,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:15:41,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2023-11-17 15:15:41,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:15:41,219 INFO L124 PetriNetUnfolderBase]: 159/325 cut-off events. [2023-11-17 15:15:41,219 INFO L125 PetriNetUnfolderBase]: For 1174/1174 co-relation queries the response was YES. [2023-11-17 15:15:41,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 325 events. 159/325 cut-off events. For 1174/1174 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1287 event pairs, 13 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 1485. Up to 104 conditions per place. [2023-11-17 15:15:41,221 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 39 selfloop transitions, 6 changer transitions 35/80 dead transitions. [2023-11-17 15:15:41,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 662 flow [2023-11-17 15:15:41,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:15:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:15:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-11-17 15:15:41,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-11-17 15:15:41,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-11-17 15:15:41,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-11-17 15:15:41,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:15:41,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-11-17 15:15:41,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 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 15:15:41,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 15:15:41,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 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 15:15:41,229 INFO L175 Difference]: Start difference. First operand has 71 places, 37 transitions, 224 flow. Second operand 7 states and 810 transitions. [2023-11-17 15:15:41,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 662 flow [2023-11-17 15:15:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 585 flow, removed 18 selfloop flow, removed 15 redundant places. [2023-11-17 15:15:41,234 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 211 flow [2023-11-17 15:15:41,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-11-17 15:15:41,234 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-11-17 15:15:41,235 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 211 flow [2023-11-17 15:15:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 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 15:15:41,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:15:41,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:41,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:15:41,235 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:15:41,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:15:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 769817467, now seen corresponding path program 5 times [2023-11-17 15:15:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:15:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113740062] [2023-11-17 15:15:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:15:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:15:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:41,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:15:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:15:41,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:15:41,363 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:15:41,364 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:15:41,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:15:41,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:15:41,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:15:41,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:15:41,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:15:41,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:15:41,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:15:41,367 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:15:41,373 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:15:41,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:15:41,434 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:15:41,437 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:15:41,439 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:15:41,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:15:41,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:15:41 BasicIcfg [2023-11-17 15:15:41,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:15:41,467 INFO L158 Benchmark]: Toolchain (without parser) took 18718.24ms. Allocated memory was 277.9MB in the beginning and 1.0GB in the end (delta: 762.3MB). Free memory was 224.5MB in the beginning and 445.2MB in the end (delta: -220.8MB). Peak memory consumption was 542.6MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,467 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 210.8MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:15:41,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.48ms. Allocated memory is still 277.9MB. Free memory was 224.5MB in the beginning and 200.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.15ms. Allocated memory is still 277.9MB. Free memory was 200.9MB in the beginning and 198.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,467 INFO L158 Benchmark]: Boogie Preprocessor took 32.87ms. Allocated memory is still 277.9MB. Free memory was 198.8MB in the beginning and 196.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,468 INFO L158 Benchmark]: RCFGBuilder took 709.70ms. Allocated memory is still 277.9MB. Free memory was 196.7MB in the beginning and 163.7MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,468 INFO L158 Benchmark]: TraceAbstraction took 17368.17ms. Allocated memory was 277.9MB in the beginning and 1.0GB in the end (delta: 762.3MB). Free memory was 244.4MB in the beginning and 445.2MB in the end (delta: -200.8MB). Peak memory consumption was 561.2MB. Max. memory is 8.0GB. [2023-11-17 15:15:41,469 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.15ms. Allocated memory is still 210.8MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 532.48ms. Allocated memory is still 277.9MB. Free memory was 224.5MB in the beginning and 200.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.15ms. Allocated memory is still 277.9MB. Free memory was 200.9MB in the beginning and 198.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.87ms. Allocated memory is still 277.9MB. Free memory was 198.8MB in the beginning and 196.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.70ms. Allocated memory is still 277.9MB. Free memory was 196.7MB in the beginning and 163.7MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17368.17ms. Allocated memory was 277.9MB in the beginning and 1.0GB in the end (delta: 762.3MB). Free memory was 244.4MB in the beginning and 445.2MB in the end (delta: -200.8MB). Peak memory consumption was 561.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 4.6s, 143 PlacesBefore, 40 PlacesAfterwards, 132 TransitionsBefore, 28 TransitionsAfterwards, 3472 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 7169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3883, independent: 3690, independent conditional: 0, independent unconditional: 3690, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2502, independent: 2429, independent conditional: 0, independent unconditional: 2429, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2502, independent: 2398, independent conditional: 0, independent unconditional: 2398, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 412, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3883, independent: 1261, independent conditional: 0, independent unconditional: 1261, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 2502, unknown conditional: 0, unknown unconditional: 2502] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 y = 1 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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_p0_EAX=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, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 861]: 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: 857]: 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: 863]: 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: 859]: 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, 174 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: 17.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 500 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1312 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 31 mSDtfsCounter, 1312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=8, InterpolantAutomatonStates: 79, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 15:15:41,496 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...