/usr/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:44:29,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:44:29,319 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-NoLbe.epf [2023-11-10 11:44:29,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:44:29,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:44:29,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:44:29,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:44:29,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:44:29,348 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:44:29,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:44:29,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:44:29,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:44:29,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:44:29,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:44:29,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:44:29,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:44:29,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:44:29,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:44:29,354 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:44:29,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:44:29,354 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:44:29,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:44:29,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:44:29,355 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:44:29,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:44:29,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:44:29,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:44:29,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:44:29,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:44:29,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:44:29,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:44:29,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:44:29,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:44:29,357 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-10 11:44:29,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:44:29,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:44:29,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:44:29,574 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:44:29,575 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:44:29,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-10 11:44:30,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:44:30,843 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:44:30,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-10 11:44:30,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c37f5ce4/675c408731bc469681141dc87b7f9cc5/FLAG57c13ef84 [2023-11-10 11:44:30,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c37f5ce4/675c408731bc469681141dc87b7f9cc5 [2023-11-10 11:44:30,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:44:30,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:44:30,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:44:30,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:44:30,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:44:30,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:30" (1/1) ... [2023-11-10 11:44:30,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9fb6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:30, skipping insertion in model container [2023-11-10 11:44:30,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:30" (1/1) ... [2023-11-10 11:44:30,913 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:44:31,074 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-10 11:44:31,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:44:31,267 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:44:31,276 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-10 11:44:31,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:44:31,326 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:44:31,326 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:44:31,331 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:44:31,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31 WrapperNode [2023-11-10 11:44:31,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:44:31,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:44:31,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:44:31,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:44:31,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,376 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-10 11:44:31,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:44:31,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:44:31,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:44:31,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:44:31,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:44:31,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:44:31,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:44:31,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:44:31,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (1/1) ... [2023-11-10 11:44:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:44:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:44:31,454 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-10 11:44:31,460 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-10 11:44:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:44:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:44:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:44:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:44:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:44:31,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:44:31,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:44:31,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:44:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:44:31,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:44:31,483 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:44:31,609 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:44:31,611 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:44:31,854 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:44:31,938 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:44:31,939 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:44:31,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:31 BoogieIcfgContainer [2023-11-10 11:44:31,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:44:31,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:44:31,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:44:31,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:44:31,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:44:30" (1/3) ... [2023-11-10 11:44:31,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cb679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:44:31, skipping insertion in model container [2023-11-10 11:44:31,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:31" (2/3) ... [2023-11-10 11:44:31,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cb679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:44:31, skipping insertion in model container [2023-11-10 11:44:31,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:31" (3/3) ... [2023-11-10 11:44:31,948 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-10 11:44:31,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:44:31,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:44:31,960 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:44:32,002 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:44:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 232 flow [2023-11-10 11:44:32,091 INFO L124 PetriNetUnfolderBase]: 2/107 cut-off events. [2023-11-10 11:44:32,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:44:32,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-11-10 11:44:32,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 232 flow [2023-11-10 11:44:32,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-11-10 11:44:32,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:44:32,119 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;@36e60762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:44:32,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-10 11:44:32,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:44:32,139 INFO L124 PetriNetUnfolderBase]: 0/69 cut-off events. [2023-11-10 11:44:32,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:44:32,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:32,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 11:44:32,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:32,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -467787691, now seen corresponding path program 1 times [2023-11-10 11:44:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:32,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806872309] [2023-11-10 11:44:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:32,597 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-10 11:44:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806872309] [2023-11-10 11:44:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806872309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:32,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:32,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:44:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217230316] [2023-11-10 11:44:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:44:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:32,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:44:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:44:32,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2023-11-10 11:44:32,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-10 11:44:32,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:32,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2023-11-10 11:44:32,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:32,748 INFO L124 PetriNetUnfolderBase]: 17/177 cut-off events. [2023-11-10 11:44:32,749 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-10 11:44:32,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 177 events. 17/177 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 402 event pairs, 3 based on Foata normal form. 7/176 useless extension candidates. Maximal degree in co-relation 182. Up to 27 conditions per place. [2023-11-10 11:44:32,753 INFO L140 encePairwiseOnDemand]: 105/110 looper letters, 10 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-11-10 11:44:32,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 106 transitions, 245 flow [2023-11-10 11:44:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:44:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:44:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-11-10 11:44:32,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-10 11:44:32,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-11-10 11:44:32,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-11-10 11:44:32,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:32,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-11-10 11:44:32,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-10 11:44:32,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-10 11:44:32,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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-10 11:44:32,777 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 223 flow. Second operand 3 states and 308 transitions. [2023-11-10 11:44:32,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 106 transitions, 245 flow [2023-11-10 11:44:32,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 106 transitions, 242 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 11:44:32,782 INFO L231 Difference]: Finished difference. Result has 112 places, 103 transitions, 216 flow [2023-11-10 11:44:32,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=112, PETRI_TRANSITIONS=103} [2023-11-10 11:44:32,786 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2023-11-10 11:44:32,786 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 103 transitions, 216 flow [2023-11-10 11:44:32,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-10 11:44:32,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:32,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:32,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:44:32,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:32,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1272235461, now seen corresponding path program 1 times [2023-11-10 11:44:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:32,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736497150] [2023-11-10 11:44:32,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:33,722 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-10 11:44:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736497150] [2023-11-10 11:44:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736497150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:33,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:44:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129262204] [2023-11-10 11:44:33,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:33,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:44:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:44:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:44:33,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2023-11-10 11:44:33,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 103 transitions, 216 flow. Second operand has 10 states, 10 states have (on average 78.9) internal successors, (789), 10 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-10 11:44:33,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:33,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2023-11-10 11:44:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:34,547 INFO L124 PetriNetUnfolderBase]: 1032/2881 cut-off events. [2023-11-10 11:44:34,547 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-11-10 11:44:34,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2881 events. 1032/2881 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23704 event pairs, 110 based on Foata normal form. 0/2812 useless extension candidates. Maximal degree in co-relation 4667. Up to 564 conditions per place. [2023-11-10 11:44:34,562 INFO L140 encePairwiseOnDemand]: 91/110 looper letters, 35 selfloop transitions, 16 changer transitions 112/227 dead transitions. [2023-11-10 11:44:34,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 227 transitions, 796 flow [2023-11-10 11:44:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:44:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:44:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1620 transitions. [2023-11-10 11:44:34,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7751196172248804 [2023-11-10 11:44:34,566 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1620 transitions. [2023-11-10 11:44:34,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1620 transitions. [2023-11-10 11:44:34,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:34,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1620 transitions. [2023-11-10 11:44:34,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 85.26315789473684) internal successors, (1620), 19 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-10 11:44:34,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 110.0) internal successors, (2200), 20 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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-10 11:44:34,575 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 110.0) internal successors, (2200), 20 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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-10 11:44:34,575 INFO L175 Difference]: Start difference. First operand has 112 places, 103 transitions, 216 flow. Second operand 19 states and 1620 transitions. [2023-11-10 11:44:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 227 transitions, 796 flow [2023-11-10 11:44:34,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 227 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:44:34,579 INFO L231 Difference]: Finished difference. Result has 144 places, 101 transitions, 352 flow [2023-11-10 11:44:34,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=352, PETRI_PLACES=144, PETRI_TRANSITIONS=101} [2023-11-10 11:44:34,579 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 29 predicate places. [2023-11-10 11:44:34,579 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 101 transitions, 352 flow [2023-11-10 11:44:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.9) internal successors, (789), 10 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-10 11:44:34,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:34,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:34,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:44:34,580 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:34,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1830073395, now seen corresponding path program 1 times [2023-11-10 11:44:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195642597] [2023-11-10 11:44:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:35,127 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-10 11:44:35,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:35,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195642597] [2023-11-10 11:44:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195642597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:35,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:44:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342947572] [2023-11-10 11:44:35,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:35,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:44:35,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:35,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:44:35,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:44:35,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2023-11-10 11:44:35,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 101 transitions, 352 flow. Second operand has 9 states, 9 states have (on average 79.33333333333333) internal successors, (714), 9 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-10 11:44:35,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:35,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2023-11-10 11:44:35,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:35,822 INFO L124 PetriNetUnfolderBase]: 474/1489 cut-off events. [2023-11-10 11:44:35,823 INFO L125 PetriNetUnfolderBase]: For 3557/4801 co-relation queries the response was YES. [2023-11-10 11:44:35,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 1489 events. 474/1489 cut-off events. For 3557/4801 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11268 event pairs, 40 based on Foata normal form. 27/1474 useless extension candidates. Maximal degree in co-relation 4481. Up to 404 conditions per place. [2023-11-10 11:44:35,835 INFO L140 encePairwiseOnDemand]: 94/110 looper letters, 51 selfloop transitions, 29 changer transitions 65/209 dead transitions. [2023-11-10 11:44:35,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 209 transitions, 1376 flow [2023-11-10 11:44:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-10 11:44:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-10 11:44:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1815 transitions. [2023-11-10 11:44:35,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2023-11-10 11:44:35,839 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1815 transitions. [2023-11-10 11:44:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1815 transitions. [2023-11-10 11:44:35,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:35,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1815 transitions. [2023-11-10 11:44:35,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 82.5) internal successors, (1815), 22 states have internal predecessors, (1815), 0 states have call successors, (0), 0 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-10 11:44:35,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 110.0) internal successors, (2530), 23 states have internal predecessors, (2530), 0 states have call successors, (0), 0 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-10 11:44:35,847 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 110.0) internal successors, (2530), 23 states have internal predecessors, (2530), 0 states have call successors, (0), 0 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-10 11:44:35,847 INFO L175 Difference]: Start difference. First operand has 144 places, 101 transitions, 352 flow. Second operand 22 states and 1815 transitions. [2023-11-10 11:44:35,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 209 transitions, 1376 flow [2023-11-10 11:44:35,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 209 transitions, 1272 flow, removed 50 selfloop flow, removed 5 redundant places. [2023-11-10 11:44:35,858 INFO L231 Difference]: Finished difference. Result has 153 places, 121 transitions, 628 flow [2023-11-10 11:44:35,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=628, PETRI_PLACES=153, PETRI_TRANSITIONS=121} [2023-11-10 11:44:35,858 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 38 predicate places. [2023-11-10 11:44:35,859 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 121 transitions, 628 flow [2023-11-10 11:44:35,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.33333333333333) internal successors, (714), 9 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-10 11:44:35,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:35,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:44:35,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:35,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1678885757, now seen corresponding path program 1 times [2023-11-10 11:44:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696508053] [2023-11-10 11:44:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:36,318 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-10 11:44:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696508053] [2023-11-10 11:44:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696508053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:44:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842480795] [2023-11-10 11:44:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:44:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:44:36,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:44:36,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2023-11-10 11:44:36,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 121 transitions, 628 flow. Second operand has 9 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-10 11:44:36,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:36,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2023-11-10 11:44:36,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:36,911 INFO L124 PetriNetUnfolderBase]: 364/1164 cut-off events. [2023-11-10 11:44:36,911 INFO L125 PetriNetUnfolderBase]: For 6395/7386 co-relation queries the response was YES. [2023-11-10 11:44:36,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 1164 events. 364/1164 cut-off events. For 6395/7386 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7827 event pairs, 60 based on Foata normal form. 39/1163 useless extension candidates. Maximal degree in co-relation 4510. Up to 391 conditions per place. [2023-11-10 11:44:36,921 INFO L140 encePairwiseOnDemand]: 94/110 looper letters, 44 selfloop transitions, 29 changer transitions 34/171 dead transitions. [2023-11-10 11:44:36,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 1297 flow [2023-11-10 11:44:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:44:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:44:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1319 transitions. [2023-11-10 11:44:36,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7494318181818181 [2023-11-10 11:44:36,924 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1319 transitions. [2023-11-10 11:44:36,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1319 transitions. [2023-11-10 11:44:36,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:36,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1319 transitions. [2023-11-10 11:44:36,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 82.4375) internal successors, (1319), 16 states have internal predecessors, (1319), 0 states have call successors, (0), 0 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-10 11:44:36,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-10 11:44:36,929 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-10 11:44:36,930 INFO L175 Difference]: Start difference. First operand has 153 places, 121 transitions, 628 flow. Second operand 16 states and 1319 transitions. [2023-11-10 11:44:36,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 1297 flow [2023-11-10 11:44:36,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 171 transitions, 1143 flow, removed 76 selfloop flow, removed 16 redundant places. [2023-11-10 11:44:36,942 INFO L231 Difference]: Finished difference. Result has 148 places, 124 transitions, 688 flow [2023-11-10 11:44:36,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=688, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2023-11-10 11:44:36,943 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 33 predicate places. [2023-11-10 11:44:36,943 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 688 flow [2023-11-10 11:44:36,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-10 11:44:36,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:36,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:36,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:44:36,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:36,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash -442178786, now seen corresponding path program 1 times [2023-11-10 11:44:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132899553] [2023-11-10 11:44:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:37,239 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-10 11:44:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132899553] [2023-11-10 11:44:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132899553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:37,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924987410] [2023-11-10 11:44:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:37,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:37,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2023-11-10 11:44:37,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 688 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 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-10 11:44:37,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:37,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2023-11-10 11:44:37,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:37,692 INFO L124 PetriNetUnfolderBase]: 352/1091 cut-off events. [2023-11-10 11:44:37,692 INFO L125 PetriNetUnfolderBase]: For 4875/6845 co-relation queries the response was YES. [2023-11-10 11:44:37,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 1091 events. 352/1091 cut-off events. For 4875/6845 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7059 event pairs, 56 based on Foata normal form. 25/1072 useless extension candidates. Maximal degree in co-relation 4282. Up to 411 conditions per place. [2023-11-10 11:44:37,700 INFO L140 encePairwiseOnDemand]: 98/110 looper letters, 55 selfloop transitions, 30 changer transitions 34/183 dead transitions. [2023-11-10 11:44:37,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 183 transitions, 1541 flow [2023-11-10 11:44:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:44:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:44:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1084 transitions. [2023-11-10 11:44:37,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7580419580419581 [2023-11-10 11:44:37,703 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1084 transitions. [2023-11-10 11:44:37,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1084 transitions. [2023-11-10 11:44:37,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:37,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1084 transitions. [2023-11-10 11:44:37,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 83.38461538461539) internal successors, (1084), 13 states have internal predecessors, (1084), 0 states have call successors, (0), 0 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-10 11:44:37,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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-10 11:44:37,713 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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-10 11:44:37,714 INFO L175 Difference]: Start difference. First operand has 148 places, 124 transitions, 688 flow. Second operand 13 states and 1084 transitions. [2023-11-10 11:44:37,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 183 transitions, 1541 flow [2023-11-10 11:44:37,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 183 transitions, 1373 flow, removed 50 selfloop flow, removed 15 redundant places. [2023-11-10 11:44:37,725 INFO L231 Difference]: Finished difference. Result has 147 places, 135 transitions, 857 flow [2023-11-10 11:44:37,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=857, PETRI_PLACES=147, PETRI_TRANSITIONS=135} [2023-11-10 11:44:37,727 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2023-11-10 11:44:37,727 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 135 transitions, 857 flow [2023-11-10 11:44:37,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 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-10 11:44:37,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:37,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:37,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:44:37,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:37,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1057336423, now seen corresponding path program 1 times [2023-11-10 11:44:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706513412] [2023-11-10 11:44:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:38,027 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-10 11:44:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706513412] [2023-11-10 11:44:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706513412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:38,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:44:38,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566005774] [2023-11-10 11:44:38,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:38,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:44:38,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:38,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:44:38,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:44:38,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 110 [2023-11-10 11:44:38,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 135 transitions, 857 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-10 11:44:38,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:38,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 110 [2023-11-10 11:44:38,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:38,359 INFO L124 PetriNetUnfolderBase]: 368/1043 cut-off events. [2023-11-10 11:44:38,359 INFO L125 PetriNetUnfolderBase]: For 5767/10366 co-relation queries the response was YES. [2023-11-10 11:44:38,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4524 conditions, 1043 events. 368/1043 cut-off events. For 5767/10366 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6741 event pairs, 70 based on Foata normal form. 61/1041 useless extension candidates. Maximal degree in co-relation 4437. Up to 371 conditions per place. [2023-11-10 11:44:38,369 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 39 selfloop transitions, 25 changer transitions 31/184 dead transitions. [2023-11-10 11:44:38,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 184 transitions, 1533 flow [2023-11-10 11:44:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 11:44:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 11:44:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 997 transitions. [2023-11-10 11:44:38,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8239669421487603 [2023-11-10 11:44:38,371 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 997 transitions. [2023-11-10 11:44:38,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 997 transitions. [2023-11-10 11:44:38,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:38,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 997 transitions. [2023-11-10 11:44:38,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.63636363636364) internal successors, (997), 11 states have internal predecessors, (997), 0 states have call successors, (0), 0 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-10 11:44:38,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 110.0) internal successors, (1320), 12 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-10 11:44:38,376 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 110.0) internal successors, (1320), 12 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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-10 11:44:38,376 INFO L175 Difference]: Start difference. First operand has 147 places, 135 transitions, 857 flow. Second operand 11 states and 997 transitions. [2023-11-10 11:44:38,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 184 transitions, 1533 flow [2023-11-10 11:44:38,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 184 transitions, 1465 flow, removed 34 selfloop flow, removed 9 redundant places. [2023-11-10 11:44:38,387 INFO L231 Difference]: Finished difference. Result has 147 places, 146 transitions, 1051 flow [2023-11-10 11:44:38,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1051, PETRI_PLACES=147, PETRI_TRANSITIONS=146} [2023-11-10 11:44:38,390 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 32 predicate places. [2023-11-10 11:44:38,390 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 1051 flow [2023-11-10 11:44:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 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-10 11:44:38,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:38,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:38,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:44:38,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:38,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 816488133, now seen corresponding path program 2 times [2023-11-10 11:44:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824456084] [2023-11-10 11:44:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:38,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:38,739 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-10 11:44:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824456084] [2023-11-10 11:44:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824456084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-10 11:44:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7938702] [2023-11-10 11:44:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-10 11:44:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-10 11:44:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-10 11:44:38,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2023-11-10 11:44:38,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 1051 flow. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 11 states have internal predecessors, (951), 0 states have call successors, (0), 0 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-10 11:44:38,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:38,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2023-11-10 11:44:38,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:39,056 INFO L124 PetriNetUnfolderBase]: 403/1175 cut-off events. [2023-11-10 11:44:39,057 INFO L125 PetriNetUnfolderBase]: For 7298/12268 co-relation queries the response was YES. [2023-11-10 11:44:39,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1175 events. 403/1175 cut-off events. For 7298/12268 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7865 event pairs, 67 based on Foata normal form. 76/1188 useless extension candidates. Maximal degree in co-relation 5305. Up to 410 conditions per place. [2023-11-10 11:44:39,066 INFO L140 encePairwiseOnDemand]: 98/110 looper letters, 41 selfloop transitions, 27 changer transitions 31/187 dead transitions. [2023-11-10 11:44:39,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 187 transitions, 1701 flow [2023-11-10 11:44:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:44:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:44:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1242 transitions. [2023-11-10 11:44:39,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8064935064935065 [2023-11-10 11:44:39,069 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1242 transitions. [2023-11-10 11:44:39,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1242 transitions. [2023-11-10 11:44:39,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:39,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1242 transitions. [2023-11-10 11:44:39,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 88.71428571428571) internal successors, (1242), 14 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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-10 11:44:39,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-10 11:44:39,074 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-10 11:44:39,074 INFO L175 Difference]: Start difference. First operand has 147 places, 146 transitions, 1051 flow. Second operand 14 states and 1242 transitions. [2023-11-10 11:44:39,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 187 transitions, 1701 flow [2023-11-10 11:44:39,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 187 transitions, 1660 flow, removed 20 selfloop flow, removed 7 redundant places. [2023-11-10 11:44:39,085 INFO L231 Difference]: Finished difference. Result has 154 places, 150 transitions, 1189 flow [2023-11-10 11:44:39,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1189, PETRI_PLACES=154, PETRI_TRANSITIONS=150} [2023-11-10 11:44:39,085 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 39 predicate places. [2023-11-10 11:44:39,086 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 150 transitions, 1189 flow [2023-11-10 11:44:39,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 11 states have internal predecessors, (951), 0 states have call successors, (0), 0 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-10 11:44:39,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:39,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:44:39,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:39,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash 913586305, now seen corresponding path program 3 times [2023-11-10 11:44:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:39,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029570937] [2023-11-10 11:44:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:39,488 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-10 11:44:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029570937] [2023-11-10 11:44:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029570937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:39,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:39,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:44:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447738239] [2023-11-10 11:44:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:44:39,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:44:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:44:39,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 110 [2023-11-10 11:44:39,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 150 transitions, 1189 flow. Second operand has 10 states, 10 states have (on average 80.1) internal successors, (801), 10 states have internal predecessors, (801), 0 states have call successors, (0), 0 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-10 11:44:39,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:39,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 110 [2023-11-10 11:44:39,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:40,010 INFO L124 PetriNetUnfolderBase]: 456/1455 cut-off events. [2023-11-10 11:44:40,010 INFO L125 PetriNetUnfolderBase]: For 11360/15589 co-relation queries the response was YES. [2023-11-10 11:44:40,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7106 conditions, 1455 events. 456/1455 cut-off events. For 11360/15589 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10797 event pairs, 17 based on Foata normal form. 121/1524 useless extension candidates. Maximal degree in co-relation 7009. Up to 416 conditions per place. [2023-11-10 11:44:40,023 INFO L140 encePairwiseOnDemand]: 96/110 looper letters, 54 selfloop transitions, 64 changer transitions 75/258 dead transitions. [2023-11-10 11:44:40,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 258 transitions, 3120 flow [2023-11-10 11:44:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:44:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:44:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1440 transitions. [2023-11-10 11:44:40,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7700534759358288 [2023-11-10 11:44:40,027 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1440 transitions. [2023-11-10 11:44:40,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1440 transitions. [2023-11-10 11:44:40,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:40,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1440 transitions. [2023-11-10 11:44:40,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.70588235294117) internal successors, (1440), 17 states have internal predecessors, (1440), 0 states have call successors, (0), 0 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-10 11:44:40,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 110.0) internal successors, (1980), 18 states have internal predecessors, (1980), 0 states have call successors, (0), 0 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-10 11:44:40,032 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 110.0) internal successors, (1980), 18 states have internal predecessors, (1980), 0 states have call successors, (0), 0 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-10 11:44:40,032 INFO L175 Difference]: Start difference. First operand has 154 places, 150 transitions, 1189 flow. Second operand 17 states and 1440 transitions. [2023-11-10 11:44:40,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 258 transitions, 3120 flow [2023-11-10 11:44:40,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 258 transitions, 3019 flow, removed 20 selfloop flow, removed 10 redundant places. [2023-11-10 11:44:40,049 INFO L231 Difference]: Finished difference. Result has 167 places, 168 transitions, 1694 flow [2023-11-10 11:44:40,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1694, PETRI_PLACES=167, PETRI_TRANSITIONS=168} [2023-11-10 11:44:40,050 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 52 predicate places. [2023-11-10 11:44:40,050 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 168 transitions, 1694 flow [2023-11-10 11:44:40,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.1) internal successors, (801), 10 states have internal predecessors, (801), 0 states have call successors, (0), 0 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-10 11:44:40,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:40,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:40,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:44:40,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:40,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1016443799, now seen corresponding path program 1 times [2023-11-10 11:44:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348370206] [2023-11-10 11:44:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:40,571 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-10 11:44:40,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:40,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348370206] [2023-11-10 11:44:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348370206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:44:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839133566] [2023-11-10 11:44:40,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:40,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:44:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:44:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:44:40,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2023-11-10 11:44:40,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 168 transitions, 1694 flow. Second operand has 12 states, 12 states have (on average 78.0) internal successors, (936), 12 states have internal predecessors, (936), 0 states have call successors, (0), 0 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-10 11:44:40,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:40,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2023-11-10 11:44:40,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:41,221 INFO L124 PetriNetUnfolderBase]: 363/1209 cut-off events. [2023-11-10 11:44:41,221 INFO L125 PetriNetUnfolderBase]: For 12586/24303 co-relation queries the response was YES. [2023-11-10 11:44:41,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6774 conditions, 1209 events. 363/1209 cut-off events. For 12586/24303 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8652 event pairs, 34 based on Foata normal form. 72/1231 useless extension candidates. Maximal degree in co-relation 6667. Up to 395 conditions per place. [2023-11-10 11:44:41,233 INFO L140 encePairwiseOnDemand]: 95/110 looper letters, 70 selfloop transitions, 68 changer transitions 28/229 dead transitions. [2023-11-10 11:44:41,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 229 transitions, 2915 flow [2023-11-10 11:44:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-10 11:44:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-10 11:44:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1612 transitions. [2023-11-10 11:44:41,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7327272727272728 [2023-11-10 11:44:41,236 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1612 transitions. [2023-11-10 11:44:41,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1612 transitions. [2023-11-10 11:44:41,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:41,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1612 transitions. [2023-11-10 11:44:41,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 80.6) internal successors, (1612), 20 states have internal predecessors, (1612), 0 states have call successors, (0), 0 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-10 11:44:41,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 110.0) internal successors, (2310), 21 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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-10 11:44:41,242 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 110.0) internal successors, (2310), 21 states have internal predecessors, (2310), 0 states have call successors, (0), 0 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-10 11:44:41,242 INFO L175 Difference]: Start difference. First operand has 167 places, 168 transitions, 1694 flow. Second operand 20 states and 1612 transitions. [2023-11-10 11:44:41,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 229 transitions, 2915 flow [2023-11-10 11:44:41,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 229 transitions, 2858 flow, removed 27 selfloop flow, removed 5 redundant places. [2023-11-10 11:44:41,268 INFO L231 Difference]: Finished difference. Result has 184 places, 181 transitions, 2141 flow [2023-11-10 11:44:41,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2141, PETRI_PLACES=184, PETRI_TRANSITIONS=181} [2023-11-10 11:44:41,268 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 69 predicate places. [2023-11-10 11:44:41,268 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 2141 flow [2023-11-10 11:44:41,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.0) internal successors, (936), 12 states have internal predecessors, (936), 0 states have call successors, (0), 0 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-10 11:44:41,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:41,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:41,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:44:41,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:41,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1334697905, now seen corresponding path program 2 times [2023-11-10 11:44:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108762565] [2023-11-10 11:44:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:41,760 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-10 11:44:41,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:41,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108762565] [2023-11-10 11:44:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108762565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:44:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193959630] [2023-11-10 11:44:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:44:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:41,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:44:41,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:44:41,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 110 [2023-11-10 11:44:41,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 181 transitions, 2141 flow. Second operand has 13 states, 13 states have (on average 85.38461538461539) internal successors, (1110), 13 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-10 11:44:41,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:41,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 110 [2023-11-10 11:44:41,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:42,116 INFO L124 PetriNetUnfolderBase]: 315/1060 cut-off events. [2023-11-10 11:44:42,117 INFO L125 PetriNetUnfolderBase]: For 15737/26623 co-relation queries the response was YES. [2023-11-10 11:44:42,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6646 conditions, 1060 events. 315/1060 cut-off events. For 15737/26623 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7596 event pairs, 60 based on Foata normal form. 97/1099 useless extension candidates. Maximal degree in co-relation 6532. Up to 337 conditions per place. [2023-11-10 11:44:42,136 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 63 selfloop transitions, 28 changer transitions 13/202 dead transitions. [2023-11-10 11:44:42,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 202 transitions, 2739 flow [2023-11-10 11:44:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 11:44:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 11:44:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1216 transitions. [2023-11-10 11:44:42,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7896103896103897 [2023-11-10 11:44:42,138 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1216 transitions. [2023-11-10 11:44:42,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1216 transitions. [2023-11-10 11:44:42,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:42,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1216 transitions. [2023-11-10 11:44:42,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 86.85714285714286) internal successors, (1216), 14 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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-10 11:44:42,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-10 11:44:42,142 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 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-10 11:44:42,142 INFO L175 Difference]: Start difference. First operand has 184 places, 181 transitions, 2141 flow. Second operand 14 states and 1216 transitions. [2023-11-10 11:44:42,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 202 transitions, 2739 flow [2023-11-10 11:44:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 202 transitions, 2540 flow, removed 60 selfloop flow, removed 13 redundant places. [2023-11-10 11:44:42,173 INFO L231 Difference]: Finished difference. Result has 182 places, 183 transitions, 2142 flow [2023-11-10 11:44:42,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1990, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2142, PETRI_PLACES=182, PETRI_TRANSITIONS=183} [2023-11-10 11:44:42,175 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 67 predicate places. [2023-11-10 11:44:42,175 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 183 transitions, 2142 flow [2023-11-10 11:44:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.38461538461539) internal successors, (1110), 13 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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-10 11:44:42,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:42,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:44:42,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:42,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:42,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2116316369, now seen corresponding path program 3 times [2023-11-10 11:44:42,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073592515] [2023-11-10 11:44:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:42,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:42,573 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-10 11:44:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073592515] [2023-11-10 11:44:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073592515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-10 11:44:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605365226] [2023-11-10 11:44:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:42,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-10 11:44:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-10 11:44:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-10 11:44:42,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 110 [2023-11-10 11:44:42,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 183 transitions, 2142 flow. Second operand has 11 states, 11 states have (on average 85.63636363636364) internal successors, (942), 11 states have internal predecessors, (942), 0 states have call successors, (0), 0 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-10 11:44:42,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:42,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 110 [2023-11-10 11:44:42,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:42,920 INFO L124 PetriNetUnfolderBase]: 290/1106 cut-off events. [2023-11-10 11:44:42,921 INFO L125 PetriNetUnfolderBase]: For 14363/25586 co-relation queries the response was YES. [2023-11-10 11:44:42,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6408 conditions, 1106 events. 290/1106 cut-off events. For 14363/25586 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8407 event pairs, 27 based on Foata normal form. 60/1105 useless extension candidates. Maximal degree in co-relation 6292. Up to 324 conditions per place. [2023-11-10 11:44:42,931 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 68 selfloop transitions, 24 changer transitions 13/203 dead transitions. [2023-11-10 11:44:42,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 203 transitions, 2732 flow [2023-11-10 11:44:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-10 11:44:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-10 11:44:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1049 transitions. [2023-11-10 11:44:42,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7946969696969697 [2023-11-10 11:44:42,935 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1049 transitions. [2023-11-10 11:44:42,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1049 transitions. [2023-11-10 11:44:42,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:42,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1049 transitions. [2023-11-10 11:44:42,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.41666666666667) internal successors, (1049), 12 states have internal predecessors, (1049), 0 states have call successors, (0), 0 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-10 11:44:42,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 110.0) internal successors, (1430), 13 states have internal predecessors, (1430), 0 states have call successors, (0), 0 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-10 11:44:42,938 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 110.0) internal successors, (1430), 13 states have internal predecessors, (1430), 0 states have call successors, (0), 0 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-10 11:44:42,938 INFO L175 Difference]: Start difference. First operand has 182 places, 183 transitions, 2142 flow. Second operand 12 states and 1049 transitions. [2023-11-10 11:44:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 203 transitions, 2732 flow [2023-11-10 11:44:42,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 203 transitions, 2588 flow, removed 53 selfloop flow, removed 15 redundant places. [2023-11-10 11:44:42,975 INFO L231 Difference]: Finished difference. Result has 179 places, 183 transitions, 2136 flow [2023-11-10 11:44:42,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2136, PETRI_PLACES=179, PETRI_TRANSITIONS=183} [2023-11-10 11:44:42,976 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 64 predicate places. [2023-11-10 11:44:42,976 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 183 transitions, 2136 flow [2023-11-10 11:44:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.63636363636364) internal successors, (942), 11 states have internal predecessors, (942), 0 states have call successors, (0), 0 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-10 11:44:42,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:42,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:42,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:44:42,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:42,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -36716899, now seen corresponding path program 1 times [2023-11-10 11:44:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198310039] [2023-11-10 11:44:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:43,096 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-10 11:44:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198310039] [2023-11-10 11:44:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198310039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:43,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:43,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:44:43,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444219896] [2023-11-10 11:44:43,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:43,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:44:43,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:43,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:44:43,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:44:43,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2023-11-10 11:44:43,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 183 transitions, 2136 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 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-10 11:44:43,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:43,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2023-11-10 11:44:43,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:43,965 INFO L124 PetriNetUnfolderBase]: 2990/5718 cut-off events. [2023-11-10 11:44:43,965 INFO L125 PetriNetUnfolderBase]: For 85076/88828 co-relation queries the response was YES. [2023-11-10 11:44:43,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29263 conditions, 5718 events. 2990/5718 cut-off events. For 85076/88828 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 46454 event pairs, 128 based on Foata normal form. 667/6103 useless extension candidates. Maximal degree in co-relation 29155. Up to 2131 conditions per place. [2023-11-10 11:44:44,013 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 146 selfloop transitions, 9 changer transitions 162/418 dead transitions. [2023-11-10 11:44:44,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 418 transitions, 6953 flow [2023-11-10 11:44:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:44:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:44:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 926 transitions. [2023-11-10 11:44:44,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8418181818181818 [2023-11-10 11:44:44,015 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 926 transitions. [2023-11-10 11:44:44,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 926 transitions. [2023-11-10 11:44:44,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:44,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 926 transitions. [2023-11-10 11:44:44,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 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-10 11:44:44,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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-10 11:44:44,017 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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-10 11:44:44,018 INFO L175 Difference]: Start difference. First operand has 179 places, 183 transitions, 2136 flow. Second operand 10 states and 926 transitions. [2023-11-10 11:44:44,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 418 transitions, 6953 flow [2023-11-10 11:44:44,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 418 transitions, 6737 flow, removed 49 selfloop flow, removed 10 redundant places. [2023-11-10 11:44:44,091 INFO L231 Difference]: Finished difference. Result has 179 places, 182 transitions, 1980 flow [2023-11-10 11:44:44,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1926, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1980, PETRI_PLACES=179, PETRI_TRANSITIONS=182} [2023-11-10 11:44:44,092 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 64 predicate places. [2023-11-10 11:44:44,092 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 182 transitions, 1980 flow [2023-11-10 11:44:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 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-10 11:44:44,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:44,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:44,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:44:44,093 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:44,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1740676162, now seen corresponding path program 1 times [2023-11-10 11:44:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150465626] [2023-11-10 11:44:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:44,215 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-10 11:44:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:44,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150465626] [2023-11-10 11:44:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150465626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50968622] [2023-11-10 11:44:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:44,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:44,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2023-11-10 11:44:44,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 182 transitions, 1980 flow. Second operand has 7 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 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-10 11:44:44,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:44,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2023-11-10 11:44:44,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:44,874 INFO L124 PetriNetUnfolderBase]: 1564/3621 cut-off events. [2023-11-10 11:44:44,874 INFO L125 PetriNetUnfolderBase]: For 50762/53569 co-relation queries the response was YES. [2023-11-10 11:44:44,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20726 conditions, 3621 events. 1564/3621 cut-off events. For 50762/53569 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 31335 event pairs, 50 based on Foata normal form. 574/4110 useless extension candidates. Maximal degree in co-relation 20618. Up to 926 conditions per place. [2023-11-10 11:44:44,936 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 131 selfloop transitions, 22 changer transitions 159/410 dead transitions. [2023-11-10 11:44:44,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 410 transitions, 6797 flow [2023-11-10 11:44:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:44:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:44:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1199 transitions. [2023-11-10 11:44:44,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2023-11-10 11:44:44,938 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1199 transitions. [2023-11-10 11:44:44,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1199 transitions. [2023-11-10 11:44:44,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:44,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1199 transitions. [2023-11-10 11:44:44,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.23076923076923) internal successors, (1199), 13 states have internal predecessors, (1199), 0 states have call successors, (0), 0 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-10 11:44:44,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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-10 11:44:44,942 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 110.0) internal successors, (1540), 14 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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-10 11:44:44,942 INFO L175 Difference]: Start difference. First operand has 179 places, 182 transitions, 1980 flow. Second operand 13 states and 1199 transitions. [2023-11-10 11:44:44,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 410 transitions, 6797 flow [2023-11-10 11:44:44,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 410 transitions, 6393 flow, removed 95 selfloop flow, removed 8 redundant places. [2023-11-10 11:44:44,997 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 1800 flow [2023-11-10 11:44:44,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1800, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2023-11-10 11:44:44,998 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 70 predicate places. [2023-11-10 11:44:44,999 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 1800 flow [2023-11-10 11:44:44,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 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-10 11:44:44,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:44,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:44,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:44:44,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:44,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 710089389, now seen corresponding path program 1 times [2023-11-10 11:44:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:45,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529716373] [2023-11-10 11:44:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:45,256 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-10 11:44:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529716373] [2023-11-10 11:44:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529716373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:44:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640572474] [2023-11-10 11:44:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:45,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:44:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:45,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:44:45,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:44:45,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2023-11-10 11:44:45,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 1800 flow. Second operand has 8 states, 8 states have (on average 78.125) internal successors, (625), 8 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-10 11:44:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2023-11-10 11:44:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:45,842 INFO L124 PetriNetUnfolderBase]: 696/3139 cut-off events. [2023-11-10 11:44:45,843 INFO L125 PetriNetUnfolderBase]: For 15095/15782 co-relation queries the response was YES. [2023-11-10 11:44:45,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12490 conditions, 3139 events. 696/3139 cut-off events. For 15095/15782 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 34830 event pairs, 17 based on Foata normal form. 50/3034 useless extension candidates. Maximal degree in co-relation 12372. Up to 997 conditions per place. [2023-11-10 11:44:45,865 INFO L140 encePairwiseOnDemand]: 96/110 looper letters, 71 selfloop transitions, 23 changer transitions 98/279 dead transitions. [2023-11-10 11:44:45,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 279 transitions, 3777 flow [2023-11-10 11:44:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:44:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:44:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 753 transitions. [2023-11-10 11:44:45,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7606060606060606 [2023-11-10 11:44:45,867 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 753 transitions. [2023-11-10 11:44:45,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 753 transitions. [2023-11-10 11:44:45,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:45,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 753 transitions. [2023-11-10 11:44:45,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.66666666666667) internal successors, (753), 9 states have internal predecessors, (753), 0 states have call successors, (0), 0 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-10 11:44:45,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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-10 11:44:45,870 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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-10 11:44:45,870 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 1800 flow. Second operand 9 states and 753 transitions. [2023-11-10 11:44:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 279 transitions, 3777 flow [2023-11-10 11:44:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 279 transitions, 3552 flow, removed 84 selfloop flow, removed 12 redundant places. [2023-11-10 11:44:45,959 INFO L231 Difference]: Finished difference. Result has 186 places, 158 transitions, 1369 flow [2023-11-10 11:44:45,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1369, PETRI_PLACES=186, PETRI_TRANSITIONS=158} [2023-11-10 11:44:45,960 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 71 predicate places. [2023-11-10 11:44:45,960 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 158 transitions, 1369 flow [2023-11-10 11:44:45,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.125) internal successors, (625), 8 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-10 11:44:45,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:45,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:45,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-10 11:44:45,961 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:45,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2133400147, now seen corresponding path program 2 times [2023-11-10 11:44:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:45,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720333295] [2023-11-10 11:44:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720333295] [2023-11-10 11:44:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720333295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314479464] [2023-11-10 11:44:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:46,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:46,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 110 [2023-11-10 11:44:46,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 158 transitions, 1369 flow. Second operand has 7 states, 7 states have (on average 80.28571428571429) internal successors, (562), 7 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-10 11:44:46,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:46,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 110 [2023-11-10 11:44:46,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:46,605 INFO L124 PetriNetUnfolderBase]: 425/2083 cut-off events. [2023-11-10 11:44:46,605 INFO L125 PetriNetUnfolderBase]: For 7049/7136 co-relation queries the response was YES. [2023-11-10 11:44:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6386 conditions, 2083 events. 425/2083 cut-off events. For 7049/7136 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21363 event pairs, 17 based on Foata normal form. 24/2012 useless extension candidates. Maximal degree in co-relation 6271. Up to 258 conditions per place. [2023-11-10 11:44:46,618 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 47 selfloop transitions, 9 changer transitions 50/193 dead transitions. [2023-11-10 11:44:46,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 2099 flow [2023-11-10 11:44:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:44:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:44:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 829 transitions. [2023-11-10 11:44:46,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7536363636363637 [2023-11-10 11:44:46,622 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 829 transitions. [2023-11-10 11:44:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 829 transitions. [2023-11-10 11:44:46,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:46,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 829 transitions. [2023-11-10 11:44:46,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.9) internal successors, (829), 10 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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-10 11:44:46,627 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 110.0) internal successors, (1210), 11 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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-10 11:44:46,627 INFO L175 Difference]: Start difference. First operand has 186 places, 158 transitions, 1369 flow. Second operand 10 states and 829 transitions. [2023-11-10 11:44:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 2099 flow [2023-11-10 11:44:46,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 193 transitions, 1950 flow, removed 23 selfloop flow, removed 15 redundant places. [2023-11-10 11:44:46,654 INFO L231 Difference]: Finished difference. Result has 180 places, 138 transitions, 939 flow [2023-11-10 11:44:46,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=939, PETRI_PLACES=180, PETRI_TRANSITIONS=138} [2023-11-10 11:44:46,655 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 65 predicate places. [2023-11-10 11:44:46,655 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 138 transitions, 939 flow [2023-11-10 11:44:46,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.28571428571429) internal successors, (562), 7 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-10 11:44:46,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:46,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:46,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-10 11:44:46,656 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:46,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1657124680, now seen corresponding path program 1 times [2023-11-10 11:44:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712520426] [2023-11-10 11:44:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:46,787 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-10 11:44:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712520426] [2023-11-10 11:44:46,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712520426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:46,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:44:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723335872] [2023-11-10 11:44:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:44:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:44:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:44:46,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2023-11-10 11:44:46,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 138 transitions, 939 flow. Second operand has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-10 11:44:46,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:46,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2023-11-10 11:44:46,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:47,151 INFO L124 PetriNetUnfolderBase]: 589/1910 cut-off events. [2023-11-10 11:44:47,151 INFO L125 PetriNetUnfolderBase]: For 10334/10896 co-relation queries the response was YES. [2023-11-10 11:44:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7714 conditions, 1910 events. 589/1910 cut-off events. For 10334/10896 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 17739 event pairs, 29 based on Foata normal form. 214/2092 useless extension candidates. Maximal degree in co-relation 7664. Up to 267 conditions per place. [2023-11-10 11:44:47,161 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 22 selfloop transitions, 12 changer transitions 129/232 dead transitions. [2023-11-10 11:44:47,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 232 transitions, 2389 flow [2023-11-10 11:44:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:44:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:44:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1440 transitions. [2023-11-10 11:44:47,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2023-11-10 11:44:47,164 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1440 transitions. [2023-11-10 11:44:47,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1440 transitions. [2023-11-10 11:44:47,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:47,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1440 transitions. [2023-11-10 11:44:47,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 90.0) internal successors, (1440), 16 states have internal predecessors, (1440), 0 states have call successors, (0), 0 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-10 11:44:47,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-10 11:44:47,169 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 110.0) internal successors, (1870), 17 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-10 11:44:47,170 INFO L175 Difference]: Start difference. First operand has 180 places, 138 transitions, 939 flow. Second operand 16 states and 1440 transitions. [2023-11-10 11:44:47,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 232 transitions, 2389 flow [2023-11-10 11:44:47,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 232 transitions, 1955 flow, removed 121 selfloop flow, removed 21 redundant places. [2023-11-10 11:44:47,192 INFO L231 Difference]: Finished difference. Result has 174 places, 97 transitions, 429 flow [2023-11-10 11:44:47,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=429, PETRI_PLACES=174, PETRI_TRANSITIONS=97} [2023-11-10 11:44:47,193 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 59 predicate places. [2023-11-10 11:44:47,194 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 97 transitions, 429 flow [2023-11-10 11:44:47,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.375) internal successors, (699), 8 states have internal predecessors, (699), 0 states have call successors, (0), 0 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-10 11:44:47,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:47,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 11:44:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-10 11:44:47,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-10 11:44:47,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 663384990, now seen corresponding path program 1 times [2023-11-10 11:44:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840063619] [2023-11-10 11:44:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:44:47,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:44:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:44:47,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:44:47,283 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:44:47,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-10 11:44:47,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-10 11:44:47,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-10 11:44:47,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-10 11:44:47,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-10 11:44:47,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-10 11:44:47,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-10 11:44:47,289 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:47,294 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:44:47,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:44:47,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-10 11:44:47,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:44:47,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:44:47,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:44:47 BasicIcfg [2023-11-10 11:44:47,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:44:47,376 INFO L158 Benchmark]: Toolchain (without parser) took 16509.90ms. Allocated memory was 192.9MB in the beginning and 780.1MB in the end (delta: 587.2MB). Free memory was 142.4MB in the beginning and 720.8MB in the end (delta: -578.4MB). Peak memory consumption was 452.4MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,377 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:44:47,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.56ms. Allocated memory is still 192.9MB. Free memory was 142.4MB in the beginning and 119.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 116.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,377 INFO L158 Benchmark]: Boogie Preprocessor took 27.72ms. Allocated memory is still 192.9MB. Free memory was 116.5MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,377 INFO L158 Benchmark]: RCFGBuilder took 536.66ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 114.7MB in the beginning and 292.3MB in the end (delta: -177.5MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,378 INFO L158 Benchmark]: TraceAbstraction took 15433.09ms. Allocated memory was 343.9MB in the beginning and 780.1MB in the end (delta: 436.2MB). Free memory was 291.7MB in the beginning and 720.8MB in the end (delta: -429.0MB). Peak memory consumption was 449.5MB. Max. memory is 8.0GB. [2023-11-10 11:44:47,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.56ms. Allocated memory is still 192.9MB. Free memory was 142.4MB in the beginning and 119.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 116.5MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.72ms. Allocated memory is still 192.9MB. Free memory was 116.5MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 536.66ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 114.7MB in the beginning and 292.3MB in the end (delta: -177.5MB). Peak memory consumption was 21.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15433.09ms. Allocated memory was 343.9MB in the beginning and 780.1MB in the end (delta: 436.2MB). Free memory was 291.7MB in the beginning and 720.8MB in the end (delta: -429.0MB). Peak memory consumption was 449.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: 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 7 procedures, 137 locations, 6 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: 15.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 968 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 1584 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2161 IncrementalHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 306 mSDtfsCounter, 2161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2142occurred in iteration=10, InterpolantAutomatonStates: 219, 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, 5.5s InterpolantComputationTime, 1244 NumberOfCodeBlocks, 1244 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1145 ConstructedInterpolants, 0 QuantifiedInterpolants, 6522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-10 11:44:47,399 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...