/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:13:51,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:13:51,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 15:13:51,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:13:51,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:13:51,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:13:51,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:13:51,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:13:51,441 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:13:51,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:13:51,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:13:51,446 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:13:51,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:13:51,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:13:51,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:13:51,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:13:51,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:13:51,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:13:51,448 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:13:51,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:13:51,449 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:13:51,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:13:51,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:13:51,450 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:13:51,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:13:51,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:51,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:13:51,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:13:51,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:13:51,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:13:51,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:13:51,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:13:51,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:13:51,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:13:51,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:13:51,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:13:51,712 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:13:51,712 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:13:51,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:13:52,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:13:53,290 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:13:53,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:13:53,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c006990/d63eeffd5b764fd3a2ed93688198c64c/FLAGee5b16ea6 [2023-11-17 15:13:53,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c006990/d63eeffd5b764fd3a2ed93688198c64c [2023-11-17 15:13:53,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:13:53,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:13:53,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:53,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:13:53,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:13:53,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aee0d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53, skipping insertion in model container [2023-11-17 15:13:53,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,376 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:13:53,509 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 15:13:53,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:53,764 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:13:53,775 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/mix023_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 15:13:53,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:13:53,876 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:53,876 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:13:53,883 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:13:53,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53 WrapperNode [2023-11-17 15:13:53,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:13:53,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:53,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:13:53,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:13:53,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,947 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-17 15:13:53,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:13:53,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:13:53,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:13:53,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:13:53,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:53,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:54,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:54,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:54,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:13:54,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:13:54,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:13:54,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:13:54,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (1/1) ... [2023-11-17 15:13:54,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:13:54,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:13:54,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:13:54,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:13:54,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:13:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:13:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:13:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:13:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:13:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:13:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:13:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:13:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:13:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:13:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:13:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 15:13:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 15:13:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:13:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:13:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:13:54,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:13:54,089 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:13:54,245 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:13:54,248 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:13:54,614 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:13:54,714 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:13:54,714 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:13:54,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:54 BoogieIcfgContainer [2023-11-17 15:13:54,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:13:54,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:13:54,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:13:54,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:13:54,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:13:53" (1/3) ... [2023-11-17 15:13:54,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2497f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:54, skipping insertion in model container [2023-11-17 15:13:54,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:13:53" (2/3) ... [2023-11-17 15:13:54,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2497f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:13:54, skipping insertion in model container [2023-11-17 15:13:54,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:13:54" (3/3) ... [2023-11-17 15:13:54,723 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.opt_pso.opt_rmo.opt.i [2023-11-17 15:13:54,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:13:54,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:13:54,739 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:13:54,808 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:13:54,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 286 flow [2023-11-17 15:13:54,928 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events. [2023-11-17 15:13:54,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:13:54,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 286 flow [2023-11-17 15:13:54,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 131 transitions, 274 flow [2023-11-17 15:13:54,942 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:13:54,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 274 flow [2023-11-17 15:13:54,957 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 274 flow [2023-11-17 15:13:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 274 flow [2023-11-17 15:13:55,002 INFO L124 PetriNetUnfolderBase]: 2/131 cut-off events. [2023-11-17 15:13:55,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:55,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-11-17 15:13:55,006 INFO L119 LiptonReduction]: Number of co-enabled transitions 3520 [2023-11-17 15:13:59,353 INFO L134 LiptonReduction]: Checked pairs total: 7742 [2023-11-17 15:13:59,353 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-17 15:13:59,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:13:59,385 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;@59c423fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:13:59,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 15:13:59,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:13:59,391 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-17 15:13:59,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:13:59,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:13:59,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:13:59,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:13:59,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:13:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash 758937190, now seen corresponding path program 1 times [2023-11-17 15:13:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:13:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323137464] [2023-11-17 15:13:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:13:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:13:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:13:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:13:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:13:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323137464] [2023-11-17 15:13:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323137464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:13:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:13:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:13:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082736567] [2023-11-17 15:13:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:13:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:13:59,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:13:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:13:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:13:59,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-11-17 15:13:59,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:13:59,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:13:59,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-11-17 15:13:59,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:00,606 INFO L124 PetriNetUnfolderBase]: 3927/5764 cut-off events. [2023-11-17 15:14:00,606 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-17 15:14:00,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11316 conditions, 5764 events. 3927/5764 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 32007 event pairs, 759 based on Foata normal form. 0/5456 useless extension candidates. Maximal degree in co-relation 11304. Up to 4225 conditions per place. [2023-11-17 15:14:00,654 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-11-17 15:14:00,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow [2023-11-17 15:14:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-11-17 15:14:00,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443548387096774 [2023-11-17 15:14:00,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-11-17 15:14:00,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-11-17 15:14:00,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:00,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-11-17 15:14:00,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:00,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:00,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:00,690 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 405 transitions. [2023-11-17 15:14:00,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow [2023-11-17 15:14:00,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 15:14:00,698 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-11-17 15:14:00,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-17 15:14:00,705 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-17 15:14:00,705 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-11-17 15:14:00,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:00,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:00,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:14:00,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:00,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1234489823, now seen corresponding path program 1 times [2023-11-17 15:14:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112166458] [2023-11-17 15:14:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:00,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112166458] [2023-11-17 15:14:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112166458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:00,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024677846] [2023-11-17 15:14:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:00,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:00,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-11-17 15:14:00,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:00,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:00,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-11-17 15:14:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:02,644 INFO L124 PetriNetUnfolderBase]: 12556/17185 cut-off events. [2023-11-17 15:14:02,644 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2023-11-17 15:14:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35532 conditions, 17185 events. 12556/17185 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 88909 event pairs, 4324 based on Foata normal form. 484/17669 useless extension candidates. Maximal degree in co-relation 35522. Up to 10805 conditions per place. [2023-11-17 15:14:02,781 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 40 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2023-11-17 15:14:02,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-11-17 15:14:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-17 15:14:02,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5026881720430108 [2023-11-17 15:14:02,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-17 15:14:02,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-17 15:14:02,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:02,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-17 15:14:02,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:02,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:02,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:02,789 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 374 transitions. [2023-11-17 15:14:02,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-11-17 15:14:02,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:02,796 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 132 flow [2023-11-17 15:14:02,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-11-17 15:14:02,797 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-17 15:14:02,798 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 132 flow [2023-11-17 15:14:02,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:02,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:02,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:02,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:14:02,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:02,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash 385518963, now seen corresponding path program 1 times [2023-11-17 15:14:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102185307] [2023-11-17 15:14:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:02,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:02,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102185307] [2023-11-17 15:14:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102185307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:02,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555514433] [2023-11-17 15:14:02,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:03,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-11-17 15:14:03,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:03,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:03,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-11-17 15:14:03,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:04,665 INFO L124 PetriNetUnfolderBase]: 11418/15651 cut-off events. [2023-11-17 15:14:04,666 INFO L125 PetriNetUnfolderBase]: For 7275/7275 co-relation queries the response was YES. [2023-11-17 15:14:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40918 conditions, 15651 events. 11418/15651 cut-off events. For 7275/7275 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 81168 event pairs, 2615 based on Foata normal form. 220/15871 useless extension candidates. Maximal degree in co-relation 40906. Up to 6937 conditions per place. [2023-11-17 15:14:04,780 INFO L140 encePairwiseOnDemand]: 239/248 looper letters, 63 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-11-17 15:14:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 388 flow [2023-11-17 15:14:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-11-17 15:14:04,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2023-11-17 15:14:04,783 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-11-17 15:14:04,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-11-17 15:14:04,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:04,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-11-17 15:14:04,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:04,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:04,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:04,788 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 132 flow. Second operand 4 states and 498 transitions. [2023-11-17 15:14:04,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 388 flow [2023-11-17 15:14:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:04,842 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 182 flow [2023-11-17 15:14:04,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-11-17 15:14:04,844 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-11-17 15:14:04,844 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 182 flow [2023-11-17 15:14:04,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:04,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:04,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:04,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:14:04,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:04,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1109672010, now seen corresponding path program 1 times [2023-11-17 15:14:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137471395] [2023-11-17 15:14:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137471395] [2023-11-17 15:14:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137471395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690553558] [2023-11-17 15:14:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:05,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:05,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:05,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-11-17 15:14:05,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:05,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:05,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-11-17 15:14:05,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:06,466 INFO L124 PetriNetUnfolderBase]: 11268/15447 cut-off events. [2023-11-17 15:14:06,466 INFO L125 PetriNetUnfolderBase]: For 12182/12182 co-relation queries the response was YES. [2023-11-17 15:14:06,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43100 conditions, 15447 events. 11268/15447 cut-off events. For 12182/12182 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 77832 event pairs, 802 based on Foata normal form. 24/15471 useless extension candidates. Maximal degree in co-relation 43085. Up to 8983 conditions per place. [2023-11-17 15:14:06,560 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 54 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2023-11-17 15:14:06,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 460 flow [2023-11-17 15:14:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-11-17 15:14:06,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49798387096774194 [2023-11-17 15:14:06,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-11-17 15:14:06,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-11-17 15:14:06,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:06,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-11-17 15:14:06,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:06,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:06,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:06,567 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 182 flow. Second operand 4 states and 494 transitions. [2023-11-17 15:14:06,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 460 flow [2023-11-17 15:14:06,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:06,603 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 344 flow [2023-11-17 15:14:06,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=344, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-11-17 15:14:06,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-11-17 15:14:06,605 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 344 flow [2023-11-17 15:14:06,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:06,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:06,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:06,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:14:06,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:06,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1592498890, now seen corresponding path program 1 times [2023-11-17 15:14:06,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636777048] [2023-11-17 15:14:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:06,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636777048] [2023-11-17 15:14:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636777048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032761246] [2023-11-17 15:14:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:06,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:06,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 248 [2023-11-17 15:14:06,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:06,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:06,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 248 [2023-11-17 15:14:06,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:07,784 INFO L124 PetriNetUnfolderBase]: 8927/12759 cut-off events. [2023-11-17 15:14:07,785 INFO L125 PetriNetUnfolderBase]: For 24430/25159 co-relation queries the response was YES. [2023-11-17 15:14:07,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38908 conditions, 12759 events. 8927/12759 cut-off events. For 24430/25159 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 70834 event pairs, 2874 based on Foata normal form. 362/12843 useless extension candidates. Maximal degree in co-relation 38889. Up to 7663 conditions per place. [2023-11-17 15:14:07,885 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 50 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-11-17 15:14:07,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 522 flow [2023-11-17 15:14:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-17 15:14:07,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2023-11-17 15:14:07,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-17 15:14:07,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-17 15:14:07,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:07,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-17 15:14:07,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:07,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:07,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:07,891 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 344 flow. Second operand 3 states and 393 transitions. [2023-11-17 15:14:07,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 522 flow [2023-11-17 15:14:07,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:14:07,951 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 358 flow [2023-11-17 15:14:07,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2023-11-17 15:14:07,952 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-11-17 15:14:07,953 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 358 flow [2023-11-17 15:14:07,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:07,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:07,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:14:07,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:07,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1183864469, now seen corresponding path program 1 times [2023-11-17 15:14:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673398528] [2023-11-17 15:14:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673398528] [2023-11-17 15:14:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673398528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319299289] [2023-11-17 15:14:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:08,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:08,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:08,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2023-11-17 15:14:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2023-11-17 15:14:08,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:09,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][108], [113#L812true, 72#L2true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 180#true, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:09,159 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,159 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][107], [72#L2true, 113#L812true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, 40#L842true, 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:09,194 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,194 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,195 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,195 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(<= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~z~0 0), 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 180#true, 175#true, Black: 153#true]) [2023-11-17 15:14:09,208 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,208 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,208 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,208 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][103], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(<= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~z~0 0), 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 175#true, Black: 153#true]) [2023-11-17 15:14:09,217 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,217 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,217 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,217 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:09,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([509] L877-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_34| 0) (= (ite (= (ite (not (and (= v_~x~0_70 2) (= 2 v_~__unbuffered_p3_EAX~0_49) (= 0 v_~__unbuffered_p3_EBX~0_54) (= v_~z~0_60 2) (= v_~__unbuffered_p1_EBX~0_69 0) (= 2 v_~__unbuffered_p1_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_42) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32| (mod v_~main$tmp_guard1~0_42 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_34|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_69, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_49, ~z~0=v_~z~0_60, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54, ~x~0=v_~x~0_70} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_34|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_69, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~z~0=v_~z~0_60, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_54, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][123], [113#L812true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 80#L835true, 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 101#P1EXITtrue, 180#true, 175#true, 127#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:09,259 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,259 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,259 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][108], [113#L812true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 15#L877true, 180#true, 175#true, Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:09,260 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,260 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(<= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, P0Thread1of1ForFork3InUse, Black: 169#(= ~z~0 0), 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 15#L877true, 175#true, 180#true, Black: 153#true]) [2023-11-17 15:14:09,294 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,295 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,295 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,295 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-17 15:14:09,365 INFO L124 PetriNetUnfolderBase]: 7944/11665 cut-off events. [2023-11-17 15:14:09,365 INFO L125 PetriNetUnfolderBase]: For 23925/24789 co-relation queries the response was YES. [2023-11-17 15:14:09,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35246 conditions, 11665 events. 7944/11665 cut-off events. For 23925/24789 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 71671 event pairs, 1314 based on Foata normal form. 1149/12321 useless extension candidates. Maximal degree in co-relation 35224. Up to 7069 conditions per place. [2023-11-17 15:14:09,467 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 106 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2023-11-17 15:14:09,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 1080 flow [2023-11-17 15:14:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2023-11-17 15:14:09,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510483870967742 [2023-11-17 15:14:09,471 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2023-11-17 15:14:09,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2023-11-17 15:14:09,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:09,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2023-11-17 15:14:09,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:09,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:09,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:09,477 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 358 flow. Second operand 5 states and 633 transitions. [2023-11-17 15:14:09,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 1080 flow [2023-11-17 15:14:09,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:09,529 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 425 flow [2023-11-17 15:14:09,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-11-17 15:14:09,532 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-17 15:14:09,532 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 425 flow [2023-11-17 15:14:09,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:09,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:09,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:09,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:14:09,533 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:09,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 901455492, now seen corresponding path program 1 times [2023-11-17 15:14:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775921836] [2023-11-17 15:14:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:09,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775921836] [2023-11-17 15:14:09,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775921836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:09,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255051225] [2023-11-17 15:14:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:09,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:09,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2023-11-17 15:14:09,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:09,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:09,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2023-11-17 15:14:09,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:10,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][160], [113#L812true, 72#L2true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, Black: 169#(= ~z~0 0), 167#true, P3Thread1of1ForFork0InUse, 40#L842true, P1Thread1of1ForFork1InUse, 101#P1EXITtrue, Black: 177#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 180#true, Black: 182#(= ~__unbuffered_cnt~0 0), Black: 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:10,597 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,598 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,598 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,598 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L835-->L842: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_117 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse0)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_103) v_~y$w_buff1_used~0_102) (= v_~y~0_72 (ite .cse4 v_~y$w_buff0~0_54 (ite .cse2 v_~y$w_buff1~0_47 v_~y~0_73))) (= v_~y$w_buff0_used~0_117 (ite .cse4 0 v_~y$w_buff0_used~0_118)) (= v_~y$r_buff0_thd4~0_25 (ite .cse3 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_54, ~y~0=v_~y~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][160], [72#L2true, 113#L812true, Black: 161#(<= ~__unbuffered_p1_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 117#P0EXITtrue, 159#true, Black: 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork3InUse, Black: 169#(= ~z~0 0), 167#true, P3Thread1of1ForFork0InUse, 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 40#L842true, P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork2InUse, 101#P1EXITtrue, 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 182#(= ~__unbuffered_cnt~0 0), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 155#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-17 15:14:10,615 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,615 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,616 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,616 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][158], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(<= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, Black: 177#(= ~__unbuffered_p3_EAX~0 0), 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 180#true, Black: 182#(= ~__unbuffered_cnt~0 0), Black: 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 153#true, Black: 185#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-17 15:14:10,624 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,624 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,624 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,625 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L812-->L819: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0)))) (let ((.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse1)) (.cse0 (and .cse5 .cse2)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_27) v_~y$r_buff0_thd3~0_26) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse2)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= v_~y~0_60 (ite .cse3 v_~y$w_buff0~0_40 (ite .cse4 v_~y$w_buff1~0_37 v_~y~0_61))) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_89) v_~y$w_buff1_used~0_88) (= v_~y$w_buff0_used~0_99 (ite .cse3 0 v_~y$w_buff0_used~0_100))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][158], [72#L2true, 170#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 161#(<= ~__unbuffered_p1_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 80#L835true, 117#P0EXITtrue, Black: 169#(= ~z~0 0), P0Thread1of1ForFork3InUse, 81#L819true, Black: 167#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, 183#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 177#(= ~__unbuffered_p3_EAX~0 0), 101#P1EXITtrue, P2Thread1of1ForFork2InUse, 194#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 182#(= ~__unbuffered_cnt~0 0), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#true]) [2023-11-17 15:14:10,628 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,628 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,628 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,628 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 15:14:10,709 INFO L124 PetriNetUnfolderBase]: 6552/9886 cut-off events. [2023-11-17 15:14:10,709 INFO L125 PetriNetUnfolderBase]: For 23388/24018 co-relation queries the response was YES. [2023-11-17 15:14:10,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36155 conditions, 9886 events. 6552/9886 cut-off events. For 23388/24018 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 61905 event pairs, 633 based on Foata normal form. 817/10348 useless extension candidates. Maximal degree in co-relation 36130. Up to 2930 conditions per place. [2023-11-17 15:14:10,774 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 140 selfloop transitions, 19 changer transitions 2/176 dead transitions. [2023-11-17 15:14:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 176 transitions, 1519 flow [2023-11-17 15:14:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-11-17 15:14:10,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511520737327189 [2023-11-17 15:14:10,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-11-17 15:14:10,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-11-17 15:14:10,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:10,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-11-17 15:14:10,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:10,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:10,782 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:10,782 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 425 flow. Second operand 7 states and 888 transitions. [2023-11-17 15:14:10,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 176 transitions, 1519 flow [2023-11-17 15:14:10,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 176 transitions, 1514 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:10,849 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 554 flow [2023-11-17 15:14:10,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2023-11-17 15:14:10,850 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-11-17 15:14:10,850 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 554 flow [2023-11-17 15:14:10,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:10,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:10,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:14:10,851 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:10,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 652206370, now seen corresponding path program 1 times [2023-11-17 15:14:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778345152] [2023-11-17 15:14:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:10,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778345152] [2023-11-17 15:14:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778345152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:11,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451273214] [2023-11-17 15:14:11,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:11,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:11,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:11,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2023-11-17 15:14:11,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 554 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:11,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:11,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2023-11-17 15:14:11,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:12,238 INFO L124 PetriNetUnfolderBase]: 9562/13965 cut-off events. [2023-11-17 15:14:12,239 INFO L125 PetriNetUnfolderBase]: For 55081/55081 co-relation queries the response was YES. [2023-11-17 15:14:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62672 conditions, 13965 events. 9562/13965 cut-off events. For 55081/55081 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 80931 event pairs, 861 based on Foata normal form. 47/14012 useless extension candidates. Maximal degree in co-relation 62643. Up to 6375 conditions per place. [2023-11-17 15:14:12,310 INFO L140 encePairwiseOnDemand]: 237/248 looper letters, 106 selfloop transitions, 42 changer transitions 38/186 dead transitions. [2023-11-17 15:14:12,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 186 transitions, 1808 flow [2023-11-17 15:14:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-11-17 15:14:12,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008064516129033 [2023-11-17 15:14:12,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-11-17 15:14:12,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-11-17 15:14:12,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:12,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-11-17 15:14:12,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:12,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:12,318 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:12,318 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 554 flow. Second operand 5 states and 621 transitions. [2023-11-17 15:14:12,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 186 transitions, 1808 flow [2023-11-17 15:14:12,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 186 transitions, 1636 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:12,831 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 833 flow [2023-11-17 15:14:12,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=833, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-11-17 15:14:12,832 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-11-17 15:14:12,832 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 833 flow [2023-11-17 15:14:12,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:12,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:12,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:12,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:14:12,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:12,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 773954890, now seen corresponding path program 1 times [2023-11-17 15:14:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426253941] [2023-11-17 15:14:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:12,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426253941] [2023-11-17 15:14:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426253941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:12,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:14:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349907118] [2023-11-17 15:14:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:14:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:14:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:14:12,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2023-11-17 15:14:12,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:12,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:12,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2023-11-17 15:14:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:13,630 INFO L124 PetriNetUnfolderBase]: 3217/5095 cut-off events. [2023-11-17 15:14:13,630 INFO L125 PetriNetUnfolderBase]: For 23098/23562 co-relation queries the response was YES. [2023-11-17 15:14:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21998 conditions, 5095 events. 3217/5095 cut-off events. For 23098/23562 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 29575 event pairs, 432 based on Foata normal form. 352/5345 useless extension candidates. Maximal degree in co-relation 21966. Up to 1714 conditions per place. [2023-11-17 15:14:13,667 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 142 selfloop transitions, 18 changer transitions 27/215 dead transitions. [2023-11-17 15:14:13,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 215 transitions, 2382 flow [2023-11-17 15:14:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions. [2023-11-17 15:14:13,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120967741935484 [2023-11-17 15:14:13,670 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions. [2023-11-17 15:14:13,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions. [2023-11-17 15:14:13,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:13,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions. [2023-11-17 15:14:13,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:13,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:13,676 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:13,676 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 833 flow. Second operand 7 states and 889 transitions. [2023-11-17 15:14:13,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 215 transitions, 2382 flow [2023-11-17 15:14:13,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 215 transitions, 2344 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:13,730 INFO L231 Difference]: Finished difference. Result has 71 places, 92 transitions, 957 flow [2023-11-17 15:14:13,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=957, PETRI_PLACES=71, PETRI_TRANSITIONS=92} [2023-11-17 15:14:13,731 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-11-17 15:14:13,731 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 92 transitions, 957 flow [2023-11-17 15:14:13,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:13,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:13,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:13,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:14:13,732 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:13,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 536897460, now seen corresponding path program 1 times [2023-11-17 15:14:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249523317] [2023-11-17 15:14:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249523317] [2023-11-17 15:14:13,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249523317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:13,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:13,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058444939] [2023-11-17 15:14:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:13,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:13,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:13,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:13,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-11-17 15:14:13,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 92 transitions, 957 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:13,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:13,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-11-17 15:14:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:14,874 INFO L124 PetriNetUnfolderBase]: 5383/8237 cut-off events. [2023-11-17 15:14:14,874 INFO L125 PetriNetUnfolderBase]: For 42199/42199 co-relation queries the response was YES. [2023-11-17 15:14:14,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40798 conditions, 8237 events. 5383/8237 cut-off events. For 42199/42199 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 46640 event pairs, 854 based on Foata normal form. 11/8248 useless extension candidates. Maximal degree in co-relation 40764. Up to 3549 conditions per place. [2023-11-17 15:14:14,915 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 96 selfloop transitions, 41 changer transitions 44/181 dead transitions. [2023-11-17 15:14:14,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 181 transitions, 2107 flow [2023-11-17 15:14:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-11-17 15:14:14,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080645161290323 [2023-11-17 15:14:14,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-11-17 15:14:14,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-11-17 15:14:14,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:14,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-11-17 15:14:14,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:14,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:14,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:14,921 INFO L175 Difference]: Start difference. First operand has 71 places, 92 transitions, 957 flow. Second operand 4 states and 504 transitions. [2023-11-17 15:14:14,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 181 transitions, 2107 flow [2023-11-17 15:14:15,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 181 transitions, 1914 flow, removed 78 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:15,208 INFO L231 Difference]: Finished difference. Result has 75 places, 91 transitions, 1078 flow [2023-11-17 15:14:15,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1078, PETRI_PLACES=75, PETRI_TRANSITIONS=91} [2023-11-17 15:14:15,209 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-11-17 15:14:15,209 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 91 transitions, 1078 flow [2023-11-17 15:14:15,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:15,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:15,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:15,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:14:15,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:15,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 874552067, now seen corresponding path program 1 times [2023-11-17 15:14:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24581798] [2023-11-17 15:14:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24581798] [2023-11-17 15:14:15,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24581798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:15,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:15,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:15,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024027500] [2023-11-17 15:14:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:15,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:15,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:15,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:15,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2023-11-17 15:14:15,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 91 transitions, 1078 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:15,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:15,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2023-11-17 15:14:15,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:16,346 INFO L124 PetriNetUnfolderBase]: 4799/7551 cut-off events. [2023-11-17 15:14:16,347 INFO L125 PetriNetUnfolderBase]: For 39327/39327 co-relation queries the response was YES. [2023-11-17 15:14:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35812 conditions, 7551 events. 4799/7551 cut-off events. For 39327/39327 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 44836 event pairs, 585 based on Foata normal form. 11/7562 useless extension candidates. Maximal degree in co-relation 35774. Up to 2776 conditions per place. [2023-11-17 15:14:16,388 INFO L140 encePairwiseOnDemand]: 237/248 looper letters, 106 selfloop transitions, 39 changer transitions 50/195 dead transitions. [2023-11-17 15:14:16,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 195 transitions, 2156 flow [2023-11-17 15:14:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 15:14:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 15:14:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-11-17 15:14:16,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49798387096774194 [2023-11-17 15:14:16,391 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-11-17 15:14:16,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-11-17 15:14:16,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:16,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-11-17 15:14:16,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:16,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:16,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:16,397 INFO L175 Difference]: Start difference. First operand has 75 places, 91 transitions, 1078 flow. Second operand 6 states and 741 transitions. [2023-11-17 15:14:16,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 195 transitions, 2156 flow [2023-11-17 15:14:16,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 195 transitions, 2081 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:16,735 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 951 flow [2023-11-17 15:14:16,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2023-11-17 15:14:16,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-11-17 15:14:16,736 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 951 flow [2023-11-17 15:14:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:16,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:16,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:14:16,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:16,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 965820319, now seen corresponding path program 2 times [2023-11-17 15:14:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70539816] [2023-11-17 15:14:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70539816] [2023-11-17 15:14:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70539816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:17,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:14:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929457983] [2023-11-17 15:14:17,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:17,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:14:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:14:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:14:17,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 248 [2023-11-17 15:14:17,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 951 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:17,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:17,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 248 [2023-11-17 15:14:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:17,646 INFO L124 PetriNetUnfolderBase]: 2650/4496 cut-off events. [2023-11-17 15:14:17,646 INFO L125 PetriNetUnfolderBase]: For 24840/25063 co-relation queries the response was YES. [2023-11-17 15:14:17,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20502 conditions, 4496 events. 2650/4496 cut-off events. For 24840/25063 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 28822 event pairs, 437 based on Foata normal form. 108/4518 useless extension candidates. Maximal degree in co-relation 20464. Up to 1693 conditions per place. [2023-11-17 15:14:17,665 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 50 selfloop transitions, 18 changer transitions 88/167 dead transitions. [2023-11-17 15:14:17,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 167 transitions, 2160 flow [2023-11-17 15:14:17,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:14:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:14:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 990 transitions. [2023-11-17 15:14:17,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49899193548387094 [2023-11-17 15:14:17,669 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 990 transitions. [2023-11-17 15:14:17,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 990 transitions. [2023-11-17 15:14:17,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:17,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 990 transitions. [2023-11-17 15:14:17,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.75) internal successors, (990), 8 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:17,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:17,675 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:17,675 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 951 flow. Second operand 8 states and 990 transitions. [2023-11-17 15:14:17,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 167 transitions, 2160 flow [2023-11-17 15:14:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 167 transitions, 1936 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-17 15:14:17,800 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 459 flow [2023-11-17 15:14:17,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=459, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2023-11-17 15:14:17,800 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-11-17 15:14:17,801 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 459 flow [2023-11-17 15:14:17,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:17,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:17,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:17,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 15:14:17,802 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:17,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1392585219, now seen corresponding path program 1 times [2023-11-17 15:14:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:17,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171847667] [2023-11-17 15:14:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171847667] [2023-11-17 15:14:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171847667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:17,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:17,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197877658] [2023-11-17 15:14:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:17,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:17,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:18,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2023-11-17 15:14:18,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 51 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:18,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2023-11-17 15:14:18,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:18,219 INFO L124 PetriNetUnfolderBase]: 1187/2002 cut-off events. [2023-11-17 15:14:18,219 INFO L125 PetriNetUnfolderBase]: For 9206/9206 co-relation queries the response was YES. [2023-11-17 15:14:18,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 2002 events. 1187/2002 cut-off events. For 9206/9206 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10023 event pairs, 321 based on Foata normal form. 1/2003 useless extension candidates. Maximal degree in co-relation 9411. Up to 1168 conditions per place. [2023-11-17 15:14:18,226 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 49 selfloop transitions, 5 changer transitions 42/96 dead transitions. [2023-11-17 15:14:18,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 96 transitions, 995 flow [2023-11-17 15:14:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-11-17 15:14:18,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-11-17 15:14:18,229 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-11-17 15:14:18,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-11-17 15:14:18,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:18,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-11-17 15:14:18,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,232 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,232 INFO L175 Difference]: Start difference. First operand has 78 places, 51 transitions, 459 flow. Second operand 4 states and 488 transitions. [2023-11-17 15:14:18,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 96 transitions, 995 flow [2023-11-17 15:14:18,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 741 flow, removed 46 selfloop flow, removed 15 redundant places. [2023-11-17 15:14:18,255 INFO L231 Difference]: Finished difference. Result has 65 places, 39 transitions, 221 flow [2023-11-17 15:14:18,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=65, PETRI_TRANSITIONS=39} [2023-11-17 15:14:18,256 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-11-17 15:14:18,256 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 39 transitions, 221 flow [2023-11-17 15:14:18,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:18,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:18,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 15:14:18,257 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:18,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash -656878101, now seen corresponding path program 2 times [2023-11-17 15:14:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:18,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314315249] [2023-11-17 15:14:18,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314315249] [2023-11-17 15:14:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314315249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:18,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:14:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917907822] [2023-11-17 15:14:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:14:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:14:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:14:18,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-11-17 15:14:18,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 39 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:18,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:18,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-11-17 15:14:18,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:19,132 INFO L124 PetriNetUnfolderBase]: 246/465 cut-off events. [2023-11-17 15:14:19,133 INFO L125 PetriNetUnfolderBase]: For 1198/1216 co-relation queries the response was YES. [2023-11-17 15:14:19,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 465 events. 246/465 cut-off events. For 1198/1216 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1983 event pairs, 34 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 1693. Up to 243 conditions per place. [2023-11-17 15:14:19,135 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 43 selfloop transitions, 4 changer transitions 26/77 dead transitions. [2023-11-17 15:14:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 583 flow [2023-11-17 15:14:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-11-17 15:14:19,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769585253456221 [2023-11-17 15:14:19,138 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-11-17 15:14:19,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-11-17 15:14:19,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:19,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-11-17 15:14:19,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:19,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:19,143 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:19,143 INFO L175 Difference]: Start difference. First operand has 65 places, 39 transitions, 221 flow. Second operand 7 states and 828 transitions. [2023-11-17 15:14:19,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 583 flow [2023-11-17 15:14:19,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 512 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-11-17 15:14:19,148 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 188 flow [2023-11-17 15:14:19,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-11-17 15:14:19,149 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-11-17 15:14:19,149 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 188 flow [2023-11-17 15:14:19,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:19,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:19,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:19,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:14:19,150 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 15:14:19,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -675098383, now seen corresponding path program 3 times [2023-11-17 15:14:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357263315] [2023-11-17 15:14:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:19,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:14:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:19,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:14:19,299 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:14:19,300 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 15:14:19,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 15:14:19,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 15:14:19,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 15:14:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 15:14:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 15:14:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 15:14:19,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 15:14:19,307 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:19,314 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:14:19,314 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:14:19,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:14:19,380 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:14:19,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:14:19,382 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 15:14:19,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:14:19 BasicIcfg [2023-11-17 15:14:19,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:14:19,410 INFO L158 Benchmark]: Toolchain (without parser) took 26086.97ms. Allocated memory was 239.1MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 181.5MB in the beginning and 613.3MB in the end (delta: -431.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 15:14:19,411 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:14:19,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.27ms. Allocated memory is still 239.1MB. Free memory was 181.0MB in the beginning and 157.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:19,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 239.1MB. Free memory was 157.9MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:19,412 INFO L158 Benchmark]: Boogie Preprocessor took 59.96ms. Allocated memory is still 239.1MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:19,412 INFO L158 Benchmark]: RCFGBuilder took 707.36ms. Allocated memory is still 239.1MB. Free memory was 153.2MB in the beginning and 184.6MB in the end (delta: -31.4MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. [2023-11-17 15:14:19,412 INFO L158 Benchmark]: TraceAbstraction took 24691.44ms. Allocated memory was 239.1MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 184.1MB in the beginning and 613.3MB in the end (delta: -429.2MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-11-17 15:14:19,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.27ms. Allocated memory is still 239.1MB. Free memory was 181.0MB in the beginning and 157.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 239.1MB. Free memory was 157.9MB in the beginning and 155.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.96ms. Allocated memory is still 239.1MB. Free memory was 155.3MB in the beginning and 153.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 707.36ms. Allocated memory is still 239.1MB. Free memory was 153.2MB in the beginning and 184.6MB in the end (delta: -31.4MB). Peak memory consumption was 23.6MB. Max. memory is 8.0GB. * TraceAbstraction took 24691.44ms. Allocated memory was 239.1MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 184.1MB in the beginning and 613.3MB in the end (delta: -429.2MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 142 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 30 TransitionsAfterwards, 3520 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 7742 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3707, independent: 3512, independent conditional: 0, independent unconditional: 3512, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2395, independent: 2327, independent conditional: 0, independent unconditional: 2327, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2395, independent: 2288, independent conditional: 0, independent unconditional: 2288, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 357, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 300, dependent conditional: 0, dependent unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3707, independent: 1185, independent conditional: 0, independent unconditional: 1185, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2395, unknown conditional: 0, unknown unconditional: 2395] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L859] 0 pthread_t t605; [L860] FCALL, FORK 0 pthread_create(&t605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L861] 0 pthread_t t606; [L862] FCALL, FORK 0 pthread_create(&t606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t607; [L864] FCALL, FORK 0 pthread_create(&t607, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t608; [L866] FCALL, FORK 0 pthread_create(&t608, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 y$w_buff1 = y$w_buff0 [L799] 3 y$w_buff0 = 1 [L800] 3 y$w_buff1_used = y$w_buff0_used [L801] 3 y$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L803] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L804] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L805] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L806] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L807] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L808] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L828] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L834] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L837] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L838] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L839] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L840] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L841] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 y$flush_delayed = weak$$choice2 [L776] 2 y$mem_tmp = y [L777] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = y [L785] 2 y = y$flush_delayed ? y$mem_tmp : y [L786] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L814] 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) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 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 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L876] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t605={5:0}, t606={6:0}, t607={7:0}, t608={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 866]: 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: 862]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1365 IncrementalHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 43 mSDtfsCounter, 1365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1078occurred in iteration=10, InterpolantAutomatonStates: 70, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:14:19,444 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...