/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:29:30,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:30,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:29:30,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:30,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:30,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:30,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:30,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:30,828 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:30,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:30,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:30,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:30,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:30,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:30,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:30,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:30,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:30,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:30,836 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:30,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:30,836 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:30,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:30,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:30,838 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:30,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:30,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:30,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:30,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:30,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:30,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:30,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:30,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:30,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:29:31,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:31,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:31,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:31,123 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:31,124 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:31,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:32,401 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:32,602 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:32,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:32,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bda0e272/219abfb7bbab442f974771019037786f/FLAGaad8adacf [2023-11-17 11:29:32,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bda0e272/219abfb7bbab442f974771019037786f [2023-11-17 11:29:32,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:32,639 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:32,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:32,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:32,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:32,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:32" (1/1) ... [2023-11-17 11:29:32,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdf05b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:32, skipping insertion in model container [2023-11-17 11:29:32,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:32" (1/1) ... [2023-11-17 11:29:32,705 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:32,837 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:29:33,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:33,095 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:33,105 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-11-17 11:29:33,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:33,200 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:33,201 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:33,207 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:33,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33 WrapperNode [2023-11-17 11:29:33,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:33,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:33,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:33,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:33,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,275 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-17 11:29:33,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:33,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:33,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:33,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:33,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:33,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:33,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:33,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:33,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (1/1) ... [2023-11-17 11:29:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:33,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:33,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:29:33,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:29:33,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:33,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:33,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:33,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:33,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:33,499 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:29:33,612 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:33,614 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:33,989 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:34,232 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:34,233 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:34,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:34 BoogieIcfgContainer [2023-11-17 11:29:34,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:34,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:34,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:34,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:34,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:32" (1/3) ... [2023-11-17 11:29:34,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:34, skipping insertion in model container [2023-11-17 11:29:34,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:33" (2/3) ... [2023-11-17 11:29:34,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2d045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:34, skipping insertion in model container [2023-11-17 11:29:34,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:34" (3/3) ... [2023-11-17 11:29:34,243 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-17 11:29:34,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:34,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:29:34,261 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:34,313 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:34,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2023-11-17 11:29:34,384 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-17 11:29:34,385 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:34,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:29:34,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2023-11-17 11:29:34,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2023-11-17 11:29:34,399 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:34,427 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 83 flow [2023-11-17 11:29:34,431 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 83 flow [2023-11-17 11:29:34,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 83 flow [2023-11-17 11:29:34,443 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2023-11-17 11:29:34,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:34,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-17 11:29:34,445 INFO L119 LiptonReduction]: Number of co-enabled transitions 790 [2023-11-17 11:29:36,269 INFO L134 LiptonReduction]: Checked pairs total: 3135 [2023-11-17 11:29:36,270 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-11-17 11:29:36,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:36,290 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;@e068cec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:36,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:29:36,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:36,294 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:29:36,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:36,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:36,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:29:36,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:36,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash 417919323, now seen corresponding path program 1 times [2023-11-17 11:29:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:36,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881817665] [2023-11-17 11:29:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:36,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881817665] [2023-11-17 11:29:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881817665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070503965] [2023-11-17 11:29:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:36,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:36,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:36,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:36,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2023-11-17 11:29:36,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:36,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:36,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2023-11-17 11:29:36,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:37,252 INFO L124 PetriNetUnfolderBase]: 1397/2220 cut-off events. [2023-11-17 11:29:37,253 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-17 11:29:37,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2220 events. 1397/2220 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11354 event pairs, 236 based on Foata normal form. 0/2100 useless extension candidates. Maximal degree in co-relation 4334. Up to 1648 conditions per place. [2023-11-17 11:29:37,274 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 33 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-17 11:29:37,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 162 flow [2023-11-17 11:29:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-17 11:29:37,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2023-11-17 11:29:37,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-17 11:29:37,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-17 11:29:37,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:37,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-17 11:29:37,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:37,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:37,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:37,296 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 88 transitions. [2023-11-17 11:29:37,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 162 flow [2023-11-17 11:29:37,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:37,300 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-17 11:29:37,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 11:29:37,304 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:29:37,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-17 11:29:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:37,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:37,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:37,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:37,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:37,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1397635451, now seen corresponding path program 1 times [2023-11-17 11:29:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701906410] [2023-11-17 11:29:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:38,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:38,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701906410] [2023-11-17 11:29:38,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701906410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:38,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:38,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:38,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029931919] [2023-11-17 11:29:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:38,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:38,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:38,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2023-11-17 11:29:38,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:38,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2023-11-17 11:29:38,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:38,613 INFO L124 PetriNetUnfolderBase]: 1049/1570 cut-off events. [2023-11-17 11:29:38,613 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-17 11:29:38,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1570 events. 1049/1570 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6717 event pairs, 249 based on Foata normal form. 24/1589 useless extension candidates. Maximal degree in co-relation 3318. Up to 1257 conditions per place. [2023-11-17 11:29:38,625 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-11-17 11:29:38,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 138 flow [2023-11-17 11:29:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2023-11-17 11:29:38,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180790960451977 [2023-11-17 11:29:38,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 74 transitions. [2023-11-17 11:29:38,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 74 transitions. [2023-11-17 11:29:38,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:38,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 74 transitions. [2023-11-17 11:29:38,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,634 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 74 transitions. [2023-11-17 11:29:38,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 138 flow [2023-11-17 11:29:38,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:38,637 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2023-11-17 11:29:38,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-17 11:29:38,637 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-17 11:29:38,638 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2023-11-17 11:29:38,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:38,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:38,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:38,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:29:38,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:38,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash -377026031, now seen corresponding path program 1 times [2023-11-17 11:29:38,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:38,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091973822] [2023-11-17 11:29:38,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091973822] [2023-11-17 11:29:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091973822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815929222] [2023-11-17 11:29:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:39,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:39,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2023-11-17 11:29:39,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:39,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2023-11-17 11:29:39,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:39,674 INFO L124 PetriNetUnfolderBase]: 929/1401 cut-off events. [2023-11-17 11:29:39,675 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-17 11:29:39,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1401 events. 929/1401 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6265 event pairs, 410 based on Foata normal form. 48/1446 useless extension candidates. Maximal degree in co-relation 3047. Up to 810 conditions per place. [2023-11-17 11:29:39,684 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-11-17 11:29:39,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2023-11-17 11:29:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2023-11-17 11:29:39,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350282485875706 [2023-11-17 11:29:39,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 77 transitions. [2023-11-17 11:29:39,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 77 transitions. [2023-11-17 11:29:39,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:39,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 77 transitions. [2023-11-17 11:29:39,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,688 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 77 transitions. [2023-11-17 11:29:39,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2023-11-17 11:29:39,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:39,690 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2023-11-17 11:29:39,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-17 11:29:39,691 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-11-17 11:29:39,691 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2023-11-17 11:29:39,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:39,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:39,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:29:39,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:39,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:39,693 INFO L85 PathProgramCache]: Analyzing trace with hash 52615613, now seen corresponding path program 1 times [2023-11-17 11:29:39,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156316097] [2023-11-17 11:29:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:39,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156316097] [2023-11-17 11:29:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156316097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:39,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:39,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214525709] [2023-11-17 11:29:39,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:39,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:39,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2023-11-17 11:29:39,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:39,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:39,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2023-11-17 11:29:39,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:40,350 INFO L124 PetriNetUnfolderBase]: 1543/2318 cut-off events. [2023-11-17 11:29:40,351 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2023-11-17 11:29:40,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5124 conditions, 2318 events. 1543/2318 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10514 event pairs, 394 based on Foata normal form. 60/2378 useless extension candidates. Maximal degree in co-relation 5112. Up to 939 conditions per place. [2023-11-17 11:29:40,360 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 37 selfloop transitions, 3 changer transitions 7/47 dead transitions. [2023-11-17 11:29:40,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 215 flow [2023-11-17 11:29:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2023-11-17 11:29:40,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4449152542372881 [2023-11-17 11:29:40,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 105 transitions. [2023-11-17 11:29:40,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 105 transitions. [2023-11-17 11:29:40,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:40,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 105 transitions. [2023-11-17 11:29:40,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,368 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,368 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 4 states and 105 transitions. [2023-11-17 11:29:40,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 215 flow [2023-11-17 11:29:40,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:40,371 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 72 flow [2023-11-17 11:29:40,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-11-17 11:29:40,374 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-11-17 11:29:40,374 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 72 flow [2023-11-17 11:29:40,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:40,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:40,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:40,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:29:40,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:40,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 921018263, now seen corresponding path program 1 times [2023-11-17 11:29:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589558417] [2023-11-17 11:29:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:41,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589558417] [2023-11-17 11:29:41,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589558417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:41,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:41,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:41,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562693732] [2023-11-17 11:29:41,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:41,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:41,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:41,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:41,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:41,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:41,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:41,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:41,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:41,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:41,516 INFO L124 PetriNetUnfolderBase]: 793/1241 cut-off events. [2023-11-17 11:29:41,516 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2023-11-17 11:29:41,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2998 conditions, 1241 events. 793/1241 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5147 event pairs, 115 based on Foata normal form. 3/1244 useless extension candidates. Maximal degree in co-relation 2984. Up to 1037 conditions per place. [2023-11-17 11:29:41,523 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 39 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2023-11-17 11:29:41,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 244 flow [2023-11-17 11:29:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-17 11:29:41,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271186440677966 [2023-11-17 11:29:41,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-17 11:29:41,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-17 11:29:41,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:41,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-17 11:29:41,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:41,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:41,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:41,527 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 72 flow. Second operand 5 states and 126 transitions. [2023-11-17 11:29:41,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 244 flow [2023-11-17 11:29:41,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 230 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:41,530 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 135 flow [2023-11-17 11:29:41,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-11-17 11:29:41,531 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-11-17 11:29:41,531 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 135 flow [2023-11-17 11:29:41,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:41,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:41,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:41,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:29:41,532 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:41,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1572362439, now seen corresponding path program 2 times [2023-11-17 11:29:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089917973] [2023-11-17 11:29:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089917973] [2023-11-17 11:29:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089917973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719389377] [2023-11-17 11:29:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:42,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:42,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:42,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:42,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:42,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:42,452 INFO L124 PetriNetUnfolderBase]: 962/1495 cut-off events. [2023-11-17 11:29:42,452 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2023-11-17 11:29:42,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4305 conditions, 1495 events. 962/1495 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6474 event pairs, 135 based on Foata normal form. 12/1507 useless extension candidates. Maximal degree in co-relation 4290. Up to 1055 conditions per place. [2023-11-17 11:29:42,464 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 38 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2023-11-17 11:29:42,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 314 flow [2023-11-17 11:29:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-17 11:29:42,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4101694915254237 [2023-11-17 11:29:42,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-17 11:29:42,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-17 11:29:42,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:42,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-17 11:29:42,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,468 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,468 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 135 flow. Second operand 5 states and 121 transitions. [2023-11-17 11:29:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 314 flow [2023-11-17 11:29:42,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:42,471 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 226 flow [2023-11-17 11:29:42,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-11-17 11:29:42,472 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-11-17 11:29:42,472 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 226 flow [2023-11-17 11:29:42,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:42,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:42,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:29:42,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:42,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:42,473 INFO L85 PathProgramCache]: Analyzing trace with hash -205654628, now seen corresponding path program 1 times [2023-11-17 11:29:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234946492] [2023-11-17 11:29:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:42,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234946492] [2023-11-17 11:29:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234946492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:42,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:42,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130723916] [2023-11-17 11:29:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:42,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:42,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:42,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2023-11-17 11:29:42,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:42,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2023-11-17 11:29:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:42,817 INFO L124 PetriNetUnfolderBase]: 560/936 cut-off events. [2023-11-17 11:29:42,817 INFO L125 PetriNetUnfolderBase]: For 1897/1901 co-relation queries the response was YES. [2023-11-17 11:29:42,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 936 events. 560/936 cut-off events. For 1897/1901 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3911 event pairs, 104 based on Foata normal form. 63/995 useless extension candidates. Maximal degree in co-relation 3349. Up to 677 conditions per place. [2023-11-17 11:29:42,825 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-11-17 11:29:42,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 472 flow [2023-11-17 11:29:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2023-11-17 11:29:42,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4180790960451977 [2023-11-17 11:29:42,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 74 transitions. [2023-11-17 11:29:42,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 74 transitions. [2023-11-17 11:29:42,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:42,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 74 transitions. [2023-11-17 11:29:42,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,828 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 226 flow. Second operand 3 states and 74 transitions. [2023-11-17 11:29:42,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 472 flow [2023-11-17 11:29:42,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 463 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:42,832 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 240 flow [2023-11-17 11:29:42,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-17 11:29:42,833 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-11-17 11:29:42,833 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 240 flow [2023-11-17 11:29:42,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:42,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:42,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:42,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:29:42,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:42,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:42,837 INFO L85 PathProgramCache]: Analyzing trace with hash -985495061, now seen corresponding path program 1 times [2023-11-17 11:29:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244345606] [2023-11-17 11:29:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:42,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:43,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244345606] [2023-11-17 11:29:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244345606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987934051] [2023-11-17 11:29:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:43,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2023-11-17 11:29:43,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:43,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2023-11-17 11:29:43,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:43,229 INFO L124 PetriNetUnfolderBase]: 318/570 cut-off events. [2023-11-17 11:29:43,229 INFO L125 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2023-11-17 11:29:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 570 events. 318/570 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2270 event pairs, 67 based on Foata normal form. 53/621 useless extension candidates. Maximal degree in co-relation 2277. Up to 249 conditions per place. [2023-11-17 11:29:43,236 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 67 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-11-17 11:29:43,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 598 flow [2023-11-17 11:29:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2023-11-17 11:29:43,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4194915254237288 [2023-11-17 11:29:43,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 99 transitions. [2023-11-17 11:29:43,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 99 transitions. [2023-11-17 11:29:43,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:43,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 99 transitions. [2023-11-17 11:29:43,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 59.0) internal successors, (295), 5 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,240 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 240 flow. Second operand 4 states and 99 transitions. [2023-11-17 11:29:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 598 flow [2023-11-17 11:29:43,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:43,244 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 276 flow [2023-11-17 11:29:43,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-11-17 11:29:43,247 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-11-17 11:29:43,248 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 276 flow [2023-11-17 11:29:43,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:43,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:29:43,251 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:43,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -427077802, now seen corresponding path program 1 times [2023-11-17 11:29:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800851815] [2023-11-17 11:29:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:43,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:43,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800851815] [2023-11-17 11:29:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800851815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050468465] [2023-11-17 11:29:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:43,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2023-11-17 11:29:43,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:43,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2023-11-17 11:29:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:43,651 INFO L124 PetriNetUnfolderBase]: 285/504 cut-off events. [2023-11-17 11:29:43,652 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2023-11-17 11:29:43,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 504 events. 285/504 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1996 event pairs, 64 based on Foata normal form. 13/515 useless extension candidates. Maximal degree in co-relation 2091. Up to 249 conditions per place. [2023-11-17 11:29:43,657 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 64 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2023-11-17 11:29:43,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 622 flow [2023-11-17 11:29:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2023-11-17 11:29:43,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.376271186440678 [2023-11-17 11:29:43,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 111 transitions. [2023-11-17 11:29:43,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 111 transitions. [2023-11-17 11:29:43,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:43,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 111 transitions. [2023-11-17 11:29:43,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,661 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 276 flow. Second operand 5 states and 111 transitions. [2023-11-17 11:29:43,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 622 flow [2023-11-17 11:29:43,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 582 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:43,667 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 272 flow [2023-11-17 11:29:43,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-11-17 11:29:43,668 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-17 11:29:43,668 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 272 flow [2023-11-17 11:29:43,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:43,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:43,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:43,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:29:43,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:43,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -656016872, now seen corresponding path program 1 times [2023-11-17 11:29:43,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107749879] [2023-11-17 11:29:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:43,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107749879] [2023-11-17 11:29:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107749879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475483627] [2023-11-17 11:29:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:44,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:29:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:29:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:29:44,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:44,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:44,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:44,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:44,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:45,457 INFO L124 PetriNetUnfolderBase]: 455/844 cut-off events. [2023-11-17 11:29:45,457 INFO L125 PetriNetUnfolderBase]: For 1796/1796 co-relation queries the response was YES. [2023-11-17 11:29:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3510 conditions, 844 events. 455/844 cut-off events. For 1796/1796 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4039 event pairs, 49 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 3490. Up to 321 conditions per place. [2023-11-17 11:29:45,463 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 80 selfloop transitions, 22 changer transitions 30/133 dead transitions. [2023-11-17 11:29:45,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 133 transitions, 1111 flow [2023-11-17 11:29:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:29:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:29:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2023-11-17 11:29:45,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218455743879473 [2023-11-17 11:29:45,465 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 224 transitions. [2023-11-17 11:29:45,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 224 transitions. [2023-11-17 11:29:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:45,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 224 transitions. [2023-11-17 11:29:45,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.88888888888889) internal successors, (224), 9 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,468 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,468 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 272 flow. Second operand 9 states and 224 transitions. [2023-11-17 11:29:45,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 133 transitions, 1111 flow [2023-11-17 11:29:45,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 133 transitions, 1001 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:45,476 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 439 flow [2023-11-17 11:29:45,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=439, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-11-17 11:29:45,478 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-11-17 11:29:45,478 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 439 flow [2023-11-17 11:29:45,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:45,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:45,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:45,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:29:45,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:45,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -775805034, now seen corresponding path program 2 times [2023-11-17 11:29:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860240583] [2023-11-17 11:29:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860240583] [2023-11-17 11:29:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860240583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:46,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:29:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848966058] [2023-11-17 11:29:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:46,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:29:46,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:29:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:29:46,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:46,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:46,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:46,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:46,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:47,292 INFO L124 PetriNetUnfolderBase]: 418/816 cut-off events. [2023-11-17 11:29:47,293 INFO L125 PetriNetUnfolderBase]: For 2030/2030 co-relation queries the response was YES. [2023-11-17 11:29:47,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3632 conditions, 816 events. 418/816 cut-off events. For 2030/2030 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4057 event pairs, 66 based on Foata normal form. 2/818 useless extension candidates. Maximal degree in co-relation 3608. Up to 444 conditions per place. [2023-11-17 11:29:47,299 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 71 selfloop transitions, 22 changer transitions 16/110 dead transitions. [2023-11-17 11:29:47,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 983 flow [2023-11-17 11:29:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:29:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:29:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2023-11-17 11:29:47,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046610169491525 [2023-11-17 11:29:47,302 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 191 transitions. [2023-11-17 11:29:47,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 191 transitions. [2023-11-17 11:29:47,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:47,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 191 transitions. [2023-11-17 11:29:47,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,304 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,304 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 439 flow. Second operand 8 states and 191 transitions. [2023-11-17 11:29:47,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 983 flow [2023-11-17 11:29:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 960 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:47,315 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 594 flow [2023-11-17 11:29:47,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2023-11-17 11:29:47,316 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2023-11-17 11:29:47,316 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 594 flow [2023-11-17 11:29:47,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:47,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:47,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:47,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:29:47,317 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:47,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1881455672, now seen corresponding path program 3 times [2023-11-17 11:29:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572844913] [2023-11-17 11:29:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:48,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572844913] [2023-11-17 11:29:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572844913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:48,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824626380] [2023-11-17 11:29:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:48,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:48,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 594 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:48,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:48,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:48,427 INFO L124 PetriNetUnfolderBase]: 512/996 cut-off events. [2023-11-17 11:29:48,428 INFO L125 PetriNetUnfolderBase]: For 2947/2947 co-relation queries the response was YES. [2023-11-17 11:29:48,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 996 events. 512/996 cut-off events. For 2947/2947 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5272 event pairs, 30 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 4644. Up to 486 conditions per place. [2023-11-17 11:29:48,436 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 71 selfloop transitions, 29 changer transitions 42/143 dead transitions. [2023-11-17 11:29:48,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1395 flow [2023-11-17 11:29:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:29:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:29:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2023-11-17 11:29:48,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4279661016949153 [2023-11-17 11:29:48,438 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 202 transitions. [2023-11-17 11:29:48,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 202 transitions. [2023-11-17 11:29:48,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:48,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 202 transitions. [2023-11-17 11:29:48,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,440 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,440 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 594 flow. Second operand 8 states and 202 transitions. [2023-11-17 11:29:48,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1395 flow [2023-11-17 11:29:48,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 143 transitions, 1356 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:48,457 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 729 flow [2023-11-17 11:29:48,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-11-17 11:29:48,458 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2023-11-17 11:29:48,458 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 729 flow [2023-11-17 11:29:48,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:48,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:48,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:48,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:29:48,459 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:48,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1705432112, now seen corresponding path program 4 times [2023-11-17 11:29:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611035835] [2023-11-17 11:29:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611035835] [2023-11-17 11:29:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611035835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-17 11:29:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671616620] [2023-11-17 11:29:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:49,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 11:29:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 11:29:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-17 11:29:49,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:49,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 729 flow. Second operand has 11 states, 11 states have (on average 16.90909090909091) internal successors, (186), 11 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:49,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:49,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:49,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:50,421 INFO L124 PetriNetUnfolderBase]: 367/701 cut-off events. [2023-11-17 11:29:50,422 INFO L125 PetriNetUnfolderBase]: For 2678/2678 co-relation queries the response was YES. [2023-11-17 11:29:50,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 701 events. 367/701 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3310 event pairs, 41 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 3575. Up to 327 conditions per place. [2023-11-17 11:29:50,432 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 66 selfloop transitions, 33 changer transitions 30/130 dead transitions. [2023-11-17 11:29:50,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 130 transitions, 1317 flow [2023-11-17 11:29:50,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 11:29:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 11:29:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2023-11-17 11:29:50,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3898305084745763 [2023-11-17 11:29:50,435 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 230 transitions. [2023-11-17 11:29:50,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 230 transitions. [2023-11-17 11:29:50,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:50,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 230 transitions. [2023-11-17 11:29:50,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:50,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 59.0) internal successors, (649), 11 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:50,437 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 59.0) internal successors, (649), 11 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:50,437 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 729 flow. Second operand 10 states and 230 transitions. [2023-11-17 11:29:50,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 130 transitions, 1317 flow [2023-11-17 11:29:50,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1192 flow, removed 53 selfloop flow, removed 6 redundant places. [2023-11-17 11:29:50,451 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 758 flow [2023-11-17 11:29:50,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=758, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2023-11-17 11:29:50,452 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2023-11-17 11:29:50,452 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 758 flow [2023-11-17 11:29:50,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.90909090909091) internal successors, (186), 11 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:50,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:50,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:50,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:29:50,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:50,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1338320702, now seen corresponding path program 5 times [2023-11-17 11:29:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076009502] [2023-11-17 11:29:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076009502] [2023-11-17 11:29:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076009502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:52,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:52,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:29:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340096087] [2023-11-17 11:29:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:52,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:29:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:29:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:29:52,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:52,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 758 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:52,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:52,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:52,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:52,906 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2023-11-17 11:29:52,907 INFO L125 PetriNetUnfolderBase]: For 3295/3295 co-relation queries the response was YES. [2023-11-17 11:29:52,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 731 events. 391/731 cut-off events. For 3295/3295 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3473 event pairs, 59 based on Foata normal form. 1/732 useless extension candidates. Maximal degree in co-relation 3995. Up to 456 conditions per place. [2023-11-17 11:29:52,916 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 91 selfloop transitions, 34 changer transitions 13/139 dead transitions. [2023-11-17 11:29:52,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1560 flow [2023-11-17 11:29:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 11:29:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 11:29:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2023-11-17 11:29:52,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3852080123266564 [2023-11-17 11:29:52,919 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 250 transitions. [2023-11-17 11:29:52,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 250 transitions. [2023-11-17 11:29:52,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:52,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 250 transitions. [2023-11-17 11:29:52,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 22.727272727272727) internal successors, (250), 11 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:52,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 59.0) internal successors, (708), 12 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:52,922 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 59.0) internal successors, (708), 12 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:52,922 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 758 flow. Second operand 11 states and 250 transitions. [2023-11-17 11:29:52,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1560 flow [2023-11-17 11:29:52,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 139 transitions, 1474 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-11-17 11:29:52,936 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 1028 flow [2023-11-17 11:29:52,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1028, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2023-11-17 11:29:52,938 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2023-11-17 11:29:52,938 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 1028 flow [2023-11-17 11:29:52,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:52,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:52,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:52,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:29:52,939 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:52,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1985620236, now seen corresponding path program 6 times [2023-11-17 11:29:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358486846] [2023-11-17 11:29:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:54,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358486846] [2023-11-17 11:29:54,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358486846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:54,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:54,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606312078] [2023-11-17 11:29:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:54,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:29:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:29:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:29:54,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:54,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 1028 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:54,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:54,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:54,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:54,649 INFO L124 PetriNetUnfolderBase]: 402/763 cut-off events. [2023-11-17 11:29:54,649 INFO L125 PetriNetUnfolderBase]: For 3494/3494 co-relation queries the response was YES. [2023-11-17 11:29:54,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4171 conditions, 763 events. 402/763 cut-off events. For 3494/3494 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3710 event pairs, 51 based on Foata normal form. 1/764 useless extension candidates. Maximal degree in co-relation 4138. Up to 288 conditions per place. [2023-11-17 11:29:54,661 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 90 selfloop transitions, 26 changer transitions 17/134 dead transitions. [2023-11-17 11:29:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 1605 flow [2023-11-17 11:29:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2023-11-17 11:29:54,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38498789346246975 [2023-11-17 11:29:54,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 159 transitions. [2023-11-17 11:29:54,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 159 transitions. [2023-11-17 11:29:54,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:54,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 159 transitions. [2023-11-17 11:29:54,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:54,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:54,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:54,671 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 1028 flow. Second operand 7 states and 159 transitions. [2023-11-17 11:29:54,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 1605 flow [2023-11-17 11:29:54,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 1558 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:54,690 INFO L231 Difference]: Finished difference. Result has 86 places, 88 transitions, 1080 flow [2023-11-17 11:29:54,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1080, PETRI_PLACES=86, PETRI_TRANSITIONS=88} [2023-11-17 11:29:54,691 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2023-11-17 11:29:54,691 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 88 transitions, 1080 flow [2023-11-17 11:29:54,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:54,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:54,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:54,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:29:54,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:54,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2067943540, now seen corresponding path program 7 times [2023-11-17 11:29:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943198045] [2023-11-17 11:29:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943198045] [2023-11-17 11:29:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943198045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:29:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623655167] [2023-11-17 11:29:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:29:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:29:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:29:55,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:55,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 88 transitions, 1080 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:55,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:55,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:55,814 INFO L124 PetriNetUnfolderBase]: 460/887 cut-off events. [2023-11-17 11:29:55,814 INFO L125 PetriNetUnfolderBase]: For 5360/5360 co-relation queries the response was YES. [2023-11-17 11:29:55,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5024 conditions, 887 events. 460/887 cut-off events. For 5360/5360 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4526 event pairs, 118 based on Foata normal form. 2/889 useless extension candidates. Maximal degree in co-relation 4992. Up to 550 conditions per place. [2023-11-17 11:29:55,821 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 79 selfloop transitions, 13 changer transitions 36/129 dead transitions. [2023-11-17 11:29:55,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 129 transitions, 1654 flow [2023-11-17 11:29:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2023-11-17 11:29:55,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387409200968523 [2023-11-17 11:29:55,823 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 160 transitions. [2023-11-17 11:29:55,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 160 transitions. [2023-11-17 11:29:55,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:55,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 160 transitions. [2023-11-17 11:29:55,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:55,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:55,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:55,825 INFO L175 Difference]: Start difference. First operand has 86 places, 88 transitions, 1080 flow. Second operand 7 states and 160 transitions. [2023-11-17 11:29:55,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 129 transitions, 1654 flow [2023-11-17 11:29:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 129 transitions, 1537 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-11-17 11:29:55,844 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 892 flow [2023-11-17 11:29:55,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=892, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-11-17 11:29:55,845 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2023-11-17 11:29:55,845 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 892 flow [2023-11-17 11:29:55,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:55,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:55,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:55,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:29:55,846 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:55,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash -464426534, now seen corresponding path program 8 times [2023-11-17 11:29:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396795526] [2023-11-17 11:29:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:56,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396795526] [2023-11-17 11:29:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396795526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:29:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590439957] [2023-11-17 11:29:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:29:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:56,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:29:56,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:29:56,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 892 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:57,445 INFO L124 PetriNetUnfolderBase]: 381/723 cut-off events. [2023-11-17 11:29:57,445 INFO L125 PetriNetUnfolderBase]: For 3822/3822 co-relation queries the response was YES. [2023-11-17 11:29:57,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 723 events. 381/723 cut-off events. For 3822/3822 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3478 event pairs, 39 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 3860. Up to 397 conditions per place. [2023-11-17 11:29:57,451 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 83 selfloop transitions, 37 changer transitions 16/137 dead transitions. [2023-11-17 11:29:57,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1500 flow [2023-11-17 11:29:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:29:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:29:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2023-11-17 11:29:57,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954802259887006 [2023-11-17 11:29:57,453 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 210 transitions. [2023-11-17 11:29:57,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 210 transitions. [2023-11-17 11:29:57,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:57,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 210 transitions. [2023-11-17 11:29:57,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.333333333333332) internal successors, (210), 9 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:57,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:57,455 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:57,455 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 892 flow. Second operand 9 states and 210 transitions. [2023-11-17 11:29:57,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1500 flow [2023-11-17 11:29:57,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 1399 flow, removed 8 selfloop flow, removed 9 redundant places. [2023-11-17 11:29:57,470 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 963 flow [2023-11-17 11:29:57,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2023-11-17 11:29:57,471 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2023-11-17 11:29:57,471 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 963 flow [2023-11-17 11:29:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:57,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:57,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:57,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:29:57,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:57,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 767097804, now seen corresponding path program 9 times [2023-11-17 11:29:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049992812] [2023-11-17 11:29:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049992812] [2023-11-17 11:29:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049992812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739614934] [2023-11-17 11:29:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:57,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:57,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:57,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:57,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:57,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:57,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:57,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:58,270 INFO L124 PetriNetUnfolderBase]: 355/683 cut-off events. [2023-11-17 11:29:58,270 INFO L125 PetriNetUnfolderBase]: For 3847/3847 co-relation queries the response was YES. [2023-11-17 11:29:58,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 683 events. 355/683 cut-off events. For 3847/3847 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3290 event pairs, 60 based on Foata normal form. 1/684 useless extension candidates. Maximal degree in co-relation 3659. Up to 297 conditions per place. [2023-11-17 11:29:58,276 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 66 selfloop transitions, 45 changer transitions 10/122 dead transitions. [2023-11-17 11:29:58,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 122 transitions, 1421 flow [2023-11-17 11:29:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2023-11-17 11:29:58,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3922518159806295 [2023-11-17 11:29:58,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 162 transitions. [2023-11-17 11:29:58,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 162 transitions. [2023-11-17 11:29:58,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:58,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 162 transitions. [2023-11-17 11:29:58,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:58,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:58,280 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:58,280 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 963 flow. Second operand 7 states and 162 transitions. [2023-11-17 11:29:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 122 transitions, 1421 flow [2023-11-17 11:29:58,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 1371 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:58,296 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 1108 flow [2023-11-17 11:29:58,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1108, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2023-11-17 11:29:58,297 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2023-11-17 11:29:58,297 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 1108 flow [2023-11-17 11:29:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:58,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:58,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:58,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:29:58,297 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:58,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -337409056, now seen corresponding path program 10 times [2023-11-17 11:29:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426374267] [2023-11-17 11:29:58,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:59,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426374267] [2023-11-17 11:29:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426374267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:59,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370803627] [2023-11-17 11:29:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:59,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:59,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:29:59,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 1108 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:59,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:59,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:29:59,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:59,547 INFO L124 PetriNetUnfolderBase]: 353/681 cut-off events. [2023-11-17 11:29:59,547 INFO L125 PetriNetUnfolderBase]: For 5257/5257 co-relation queries the response was YES. [2023-11-17 11:29:59,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 681 events. 353/681 cut-off events. For 5257/5257 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3262 event pairs, 82 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 3971. Up to 607 conditions per place. [2023-11-17 11:29:59,552 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 76 selfloop transitions, 21 changer transitions 11/109 dead transitions. [2023-11-17 11:29:59,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 109 transitions, 1449 flow [2023-11-17 11:29:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2023-11-17 11:29:59,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36077481840193704 [2023-11-17 11:29:59,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 149 transitions. [2023-11-17 11:29:59,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 149 transitions. [2023-11-17 11:29:59,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:59,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 149 transitions. [2023-11-17 11:29:59,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:59,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:59,556 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:59,556 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 1108 flow. Second operand 7 states and 149 transitions. [2023-11-17 11:29:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 109 transitions, 1449 flow [2023-11-17 11:29:59,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 1379 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:59,573 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 1065 flow [2023-11-17 11:29:59,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1065, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2023-11-17 11:29:59,574 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 59 predicate places. [2023-11-17 11:29:59,574 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 1065 flow [2023-11-17 11:29:59,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:59,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:59,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:59,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 11:29:59,574 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:29:59,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -288329382, now seen corresponding path program 11 times [2023-11-17 11:29:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052489399] [2023-11-17 11:29:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:00,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:00,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052489399] [2023-11-17 11:30:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052489399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:00,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:30:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219722938] [2023-11-17 11:30:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:00,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:30:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:00,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:30:00,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:30:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 1065 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:00,367 INFO L124 PetriNetUnfolderBase]: 326/643 cut-off events. [2023-11-17 11:30:00,367 INFO L125 PetriNetUnfolderBase]: For 4137/4137 co-relation queries the response was YES. [2023-11-17 11:30:00,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3704 conditions, 643 events. 326/643 cut-off events. For 4137/4137 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3109 event pairs, 111 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 3671. Up to 484 conditions per place. [2023-11-17 11:30:00,372 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 73 selfloop transitions, 2 changer transitions 42/118 dead transitions. [2023-11-17 11:30:00,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 1486 flow [2023-11-17 11:30:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:30:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:30:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-17 11:30:00,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3728813559322034 [2023-11-17 11:30:00,374 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-17 11:30:00,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-17 11:30:00,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:00,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-17 11:30:00,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:00,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:00,375 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:00,375 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 1065 flow. Second operand 7 states and 154 transitions. [2023-11-17 11:30:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 118 transitions, 1486 flow [2023-11-17 11:30:00,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 1462 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-17 11:30:00,393 INFO L231 Difference]: Finished difference. Result has 95 places, 74 transitions, 899 flow [2023-11-17 11:30:00,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=899, PETRI_PLACES=95, PETRI_TRANSITIONS=74} [2023-11-17 11:30:00,393 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2023-11-17 11:30:00,393 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 74 transitions, 899 flow [2023-11-17 11:30:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:00,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:00,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:00,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 11:30:00,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:00,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:00,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1315690808, now seen corresponding path program 12 times [2023-11-17 11:30:00,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:00,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008392599] [2023-11-17 11:30:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008392599] [2023-11-17 11:30:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008392599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:30:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281226498] [2023-11-17 11:30:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:01,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:30:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:30:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:30:01,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:01,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 74 transitions, 899 flow. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:01,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:01,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:01,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:01,848 INFO L124 PetriNetUnfolderBase]: 262/514 cut-off events. [2023-11-17 11:30:01,848 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2023-11-17 11:30:01,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 514 events. 262/514 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2346 event pairs, 31 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 2927. Up to 226 conditions per place. [2023-11-17 11:30:01,852 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 28 changer transitions 19/115 dead transitions. [2023-11-17 11:30:01,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 1352 flow [2023-11-17 11:30:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:30:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:30:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2023-11-17 11:30:01,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39951573849878935 [2023-11-17 11:30:01,854 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 165 transitions. [2023-11-17 11:30:01,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 165 transitions. [2023-11-17 11:30:01,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:01,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 165 transitions. [2023-11-17 11:30:01,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:01,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:01,856 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 59.0) internal successors, (472), 8 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:01,856 INFO L175 Difference]: Start difference. First operand has 95 places, 74 transitions, 899 flow. Second operand 7 states and 165 transitions. [2023-11-17 11:30:01,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 1352 flow [2023-11-17 11:30:01,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 115 transitions, 1302 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:30:01,869 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 915 flow [2023-11-17 11:30:01,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=915, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2023-11-17 11:30:01,870 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2023-11-17 11:30:01,870 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 915 flow [2023-11-17 11:30:01,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:01,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:01,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:01,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-17 11:30:01,871 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:01,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2107704906, now seen corresponding path program 13 times [2023-11-17 11:30:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:01,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733501782] [2023-11-17 11:30:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:02,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:02,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733501782] [2023-11-17 11:30:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733501782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:30:02,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266950287] [2023-11-17 11:30:02,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:02,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:30:02,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:02,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:30:02,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:30:02,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:02,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 915 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:02,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:02,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:02,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:03,162 INFO L124 PetriNetUnfolderBase]: 224/446 cut-off events. [2023-11-17 11:30:03,163 INFO L125 PetriNetUnfolderBase]: For 3600/3600 co-relation queries the response was YES. [2023-11-17 11:30:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 446 events. 224/446 cut-off events. For 3600/3600 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1987 event pairs, 62 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 2670. Up to 274 conditions per place. [2023-11-17 11:30:03,167 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 40 selfloop transitions, 39 changer transitions 20/100 dead transitions. [2023-11-17 11:30:03,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 1323 flow [2023-11-17 11:30:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:30:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:30:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2023-11-17 11:30:03,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3601694915254237 [2023-11-17 11:30:03,169 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 170 transitions. [2023-11-17 11:30:03,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 170 transitions. [2023-11-17 11:30:03,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:03,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 170 transitions. [2023-11-17 11:30:03,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:03,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:03,170 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:03,170 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 915 flow. Second operand 8 states and 170 transitions. [2023-11-17 11:30:03,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 1323 flow [2023-11-17 11:30:03,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 100 transitions, 1237 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:30:03,201 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 943 flow [2023-11-17 11:30:03,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=943, PETRI_PLACES=90, PETRI_TRANSITIONS=73} [2023-11-17 11:30:03,203 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 56 predicate places. [2023-11-17 11:30:03,204 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 943 flow [2023-11-17 11:30:03,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:03,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:03,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:03,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-17 11:30:03,205 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:03,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash 431523466, now seen corresponding path program 14 times [2023-11-17 11:30:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:03,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339428774] [2023-11-17 11:30:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:04,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339428774] [2023-11-17 11:30:04,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339428774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:04,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:30:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214835537] [2023-11-17 11:30:04,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:04,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:30:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:30:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:30:04,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:04,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 73 transitions, 943 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:04,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:04,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:04,437 INFO L124 PetriNetUnfolderBase]: 265/536 cut-off events. [2023-11-17 11:30:04,437 INFO L125 PetriNetUnfolderBase]: For 3971/3971 co-relation queries the response was YES. [2023-11-17 11:30:04,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3152 conditions, 536 events. 265/536 cut-off events. For 3971/3971 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2533 event pairs, 86 based on Foata normal form. 2/538 useless extension candidates. Maximal degree in co-relation 3119. Up to 239 conditions per place. [2023-11-17 11:30:04,441 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 48 selfloop transitions, 14 changer transitions 49/112 dead transitions. [2023-11-17 11:30:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1411 flow [2023-11-17 11:30:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 11:30:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 11:30:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2023-11-17 11:30:04,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3420647149460709 [2023-11-17 11:30:04,443 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 222 transitions. [2023-11-17 11:30:04,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 222 transitions. [2023-11-17 11:30:04,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:04,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 222 transitions. [2023-11-17 11:30:04,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 20.181818181818183) internal successors, (222), 11 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 59.0) internal successors, (708), 12 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,445 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 59.0) internal successors, (708), 12 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,445 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 943 flow. Second operand 11 states and 222 transitions. [2023-11-17 11:30:04,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1411 flow [2023-11-17 11:30:04,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 1298 flow, removed 17 selfloop flow, removed 9 redundant places. [2023-11-17 11:30:04,458 INFO L231 Difference]: Finished difference. Result has 92 places, 51 transitions, 527 flow [2023-11-17 11:30:04,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=527, PETRI_PLACES=92, PETRI_TRANSITIONS=51} [2023-11-17 11:30:04,458 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2023-11-17 11:30:04,458 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 51 transitions, 527 flow [2023-11-17 11:30:04,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:04,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:04,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:04,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 11:30:04,459 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:04,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:04,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1216265768, now seen corresponding path program 15 times [2023-11-17 11:30:04,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:04,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689753792] [2023-11-17 11:30:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689753792] [2023-11-17 11:30:05,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689753792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 11:30:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146081713] [2023-11-17 11:30:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:05,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-17 11:30:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-17 11:30:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-17 11:30:05,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:05,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 51 transitions, 527 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:05,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:05,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:05,840 INFO L124 PetriNetUnfolderBase]: 164/342 cut-off events. [2023-11-17 11:30:05,840 INFO L125 PetriNetUnfolderBase]: For 2091/2091 co-relation queries the response was YES. [2023-11-17 11:30:05,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 342 events. 164/342 cut-off events. For 2091/2091 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1422 event pairs, 44 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 1909. Up to 208 conditions per place. [2023-11-17 11:30:05,843 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 42 selfloop transitions, 7 changer transitions 28/78 dead transitions. [2023-11-17 11:30:05,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 78 transitions, 890 flow [2023-11-17 11:30:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:30:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:30:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2023-11-17 11:30:05,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3495762711864407 [2023-11-17 11:30:05,845 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 165 transitions. [2023-11-17 11:30:05,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 165 transitions. [2023-11-17 11:30:05,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:05,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 165 transitions. [2023-11-17 11:30:05,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,847 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 59.0) internal successors, (531), 9 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,847 INFO L175 Difference]: Start difference. First operand has 92 places, 51 transitions, 527 flow. Second operand 8 states and 165 transitions. [2023-11-17 11:30:05,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 78 transitions, 890 flow [2023-11-17 11:30:05,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 699 flow, removed 23 selfloop flow, removed 23 redundant places. [2023-11-17 11:30:05,854 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 359 flow [2023-11-17 11:30:05,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-11-17 11:30:05,855 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-11-17 11:30:05,855 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 359 flow [2023-11-17 11:30:05,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:05,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:05,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:05,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-17 11:30:05,856 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:05,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1252693470, now seen corresponding path program 16 times [2023-11-17 11:30:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264296415] [2023-11-17 11:30:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:30:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:30:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:30:06,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264296415] [2023-11-17 11:30:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264296415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:30:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:30:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 11:30:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752145818] [2023-11-17 11:30:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:30:06,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 11:30:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:30:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 11:30:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-17 11:30:06,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2023-11-17 11:30:06,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:06,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:30:06,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2023-11-17 11:30:06,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:30:07,052 INFO L124 PetriNetUnfolderBase]: 156/346 cut-off events. [2023-11-17 11:30:07,053 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2023-11-17 11:30:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 346 events. 156/346 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1564 event pairs, 15 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1601. Up to 147 conditions per place. [2023-11-17 11:30:07,055 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 57 selfloop transitions, 18 changer transitions 30/106 dead transitions. [2023-11-17 11:30:07,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 940 flow [2023-11-17 11:30:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 11:30:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 11:30:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2023-11-17 11:30:07,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3653483992467043 [2023-11-17 11:30:07,057 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 194 transitions. [2023-11-17 11:30:07,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 194 transitions. [2023-11-17 11:30:07,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:30:07,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 194 transitions. [2023-11-17 11:30:07,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,059 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 59.0) internal successors, (590), 10 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,059 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 359 flow. Second operand 9 states and 194 transitions. [2023-11-17 11:30:07,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 940 flow [2023-11-17 11:30:07,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 917 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-11-17 11:30:07,065 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 468 flow [2023-11-17 11:30:07,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=468, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-11-17 11:30:07,065 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2023-11-17 11:30:07,065 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 468 flow [2023-11-17 11:30:07,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:30:07,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:30:07,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-17 11:30:07,066 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 11:30:07,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:30:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1124334770, now seen corresponding path program 17 times [2023-11-17 11:30:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:30:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194338061] [2023-11-17 11:30:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:30:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:30:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:07,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:30:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:30:07,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:30:07,196 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:30:07,197 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:30:07,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:30:07,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:30:07,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 11:30:07,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 11:30:07,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:30:07,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-17 11:30:07,201 INFO L445 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:30:07,207 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:30:07,207 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:30:07,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:30:07,244 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:30:07,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 11:30:07,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:30:07 BasicIcfg [2023-11-17 11:30:07,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:30:07,267 INFO L158 Benchmark]: Toolchain (without parser) took 34627.89ms. Allocated memory was 183.5MB in the beginning and 566.2MB in the end (delta: 382.7MB). Free memory was 138.6MB in the beginning and 270.5MB in the end (delta: -132.0MB). Peak memory consumption was 252.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,267 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 183.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:30:07,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.58ms. Allocated memory is still 183.5MB. Free memory was 138.0MB in the beginning and 112.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.06ms. Allocated memory is still 183.5MB. Free memory was 112.2MB in the beginning and 109.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,267 INFO L158 Benchmark]: Boogie Preprocessor took 41.17ms. Allocated memory is still 183.5MB. Free memory was 109.3MB in the beginning and 106.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,268 INFO L158 Benchmark]: RCFGBuilder took 916.36ms. Allocated memory is still 183.5MB. Free memory was 106.9MB in the beginning and 111.5MB in the end (delta: -4.5MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,268 INFO L158 Benchmark]: TraceAbstraction took 33028.90ms. Allocated memory was 183.5MB in the beginning and 566.2MB in the end (delta: 382.7MB). Free memory was 110.9MB in the beginning and 270.5MB in the end (delta: -159.6MB). Peak memory consumption was 223.1MB. Max. memory is 8.0GB. [2023-11-17 11:30:07,269 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.17ms. Allocated memory is still 183.5MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 568.58ms. Allocated memory is still 183.5MB. Free memory was 138.0MB in the beginning and 112.2MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.06ms. Allocated memory is still 183.5MB. Free memory was 112.2MB in the beginning and 109.3MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.17ms. Allocated memory is still 183.5MB. Free memory was 109.3MB in the beginning and 106.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 916.36ms. Allocated memory is still 183.5MB. Free memory was 106.9MB in the beginning and 111.5MB in the end (delta: -4.5MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. * TraceAbstraction took 33028.90ms. Allocated memory was 183.5MB in the beginning and 566.2MB in the end (delta: 382.7MB). Free memory was 110.9MB in the beginning and 270.5MB in the end (delta: -159.6MB). Peak memory consumption was 223.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 46 PlacesBefore, 34 PlacesAfterwards, 37 TransitionsBefore, 25 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 19 TotalNumberOfCompositions, 3135 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1056, independent: 908, independent conditional: 0, independent unconditional: 908, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 549, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 549, independent: 465, independent conditional: 0, independent unconditional: 465, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 474, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1056, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 549, unknown conditional: 0, unknown unconditional: 549] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 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: 32.9s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 889 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3219 IncrementalHoareTripleChecker+Invalid, 3583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 1 mSDtfsCounter, 3219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1108occurred in iteration=18, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 6945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:30:07,291 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...