/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/mix011_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:12:43,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:12:43,857 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:12:43,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:12:43,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:12:43,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:12:43,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:12:43,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:12:43,873 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:12:43,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:12:43,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:12:43,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:12:43,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:12:43,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:12:43,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:12:43,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:12:43,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:12:43,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:12:43,875 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:12:43,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:12:43,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:12:43,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:12:43,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:12:43,876 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:12:43,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:12:43,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:43,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:12:43,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:12:43,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:12:43,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:12:43,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:12:43,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:12:43,878 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:12:44,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:12:44,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:12:44,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:12:44,034 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:12:44,034 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:12:44,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:45,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:12:45,244 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:12:45,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:45,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7138232/d413caa4a65e43f7973ae9e8b49d7735/FLAGd5de9a59b [2023-11-17 15:12:45,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec7138232/d413caa4a65e43f7973ae9e8b49d7735 [2023-11-17 15:12:45,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:12:45,272 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:12:45,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:45,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:12:45,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:12:45,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0d0cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45, skipping insertion in model container [2023-11-17 15:12:45,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,321 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:12:45,446 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:12:45,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:45,632 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:12:45,648 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:12:45,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:12:45,697 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:45,697 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:12:45,702 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:12:45,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45 WrapperNode [2023-11-17 15:12:45,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:12:45,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:45,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:12:45,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:12:45,711 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:12:45" (1/1) ... [2023-11-17 15:12:45,729 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:12:45" (1/1) ... [2023-11-17 15:12:45,746 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-17 15:12:45,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:12:45,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:12:45,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:12:45,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:12:45,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:12:45,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:12:45,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:12:45,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:12:45,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (1/1) ... [2023-11-17 15:12:45,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:12:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:12:45,793 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:12:45,802 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:12:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:12:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:12:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:12:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:12:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:12:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:12:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:12:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:12:45,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:12:45,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:12:45,824 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:12:45,912 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:12:45,913 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:12:46,145 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:12:46,257 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:12:46,257 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:12:46,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:46 BoogieIcfgContainer [2023-11-17 15:12:46,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:12:46,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:12:46,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:12:46,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:12:46,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:12:45" (1/3) ... [2023-11-17 15:12:46,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf0302b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:46, skipping insertion in model container [2023-11-17 15:12:46,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:12:45" (2/3) ... [2023-11-17 15:12:46,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf0302b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:12:46, skipping insertion in model container [2023-11-17 15:12:46,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:12:46" (3/3) ... [2023-11-17 15:12:46,270 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:12:46,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:12:46,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:12:46,281 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:12:46,326 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:12:46,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 248 flow [2023-11-17 15:12:46,415 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-11-17 15:12:46,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:46,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:12:46,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 248 flow [2023-11-17 15:12:46,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:46,429 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:12:46,438 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:46,440 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:46,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-11-17 15:12:46,460 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-11-17 15:12:46,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-11-17 15:12:46,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2023-11-17 15:12:49,649 INFO L134 LiptonReduction]: Checked pairs total: 6879 [2023-11-17 15:12:49,649 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-11-17 15:12:49,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:12:49,664 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;@1c48eea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:12:49,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:12:49,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:12:49,667 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-17 15:12:49,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:12:49,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:49,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:12:49,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:49,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash 508969, now seen corresponding path program 1 times [2023-11-17 15:12:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531543617] [2023-11-17 15:12:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:49,913 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:12:49,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:49,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531543617] [2023-11-17 15:12:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531543617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470300577] [2023-11-17 15:12:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:49,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:49,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:49,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 224 [2023-11-17 15:12:49,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:12:49,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:49,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 224 [2023-11-17 15:12:49,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:50,200 INFO L124 PetriNetUnfolderBase]: 1144/1837 cut-off events. [2023-11-17 15:12:50,200 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-17 15:12:50,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3585 conditions, 1837 events. 1144/1837 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9875 event pairs, 184 based on Foata normal form. 0/1731 useless extension candidates. Maximal degree in co-relation 3574. Up to 1372 conditions per place. [2023-11-17 15:12:50,213 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-17 15:12:50,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-11-17 15:12:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-17 15:12:50,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2023-11-17 15:12:50,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-17 15:12:50,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-17 15:12:50,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:50,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-17 15:12:50,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:50,238 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:50,239 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 63 flow. Second operand 3 states and 350 transitions. [2023-11-17 15:12:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-11-17 15:12:50,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:50,243 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 15:12:50,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 15:12:50,248 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 15:12:50,249 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 15:12:50,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have 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:12:50,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:50,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:50,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:12:50,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:50,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1099529931, now seen corresponding path program 1 times [2023-11-17 15:12:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230606220] [2023-11-17 15:12:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:50,472 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:12:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230606220] [2023-11-17 15:12:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230606220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825298467] [2023-11-17 15:12:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:50,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-11-17 15:12:50,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:50,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-11-17 15:12:50,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:50,757 INFO L124 PetriNetUnfolderBase]: 2459/3678 cut-off events. [2023-11-17 15:12:50,757 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-11-17 15:12:50,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17909 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7608. Up to 2550 conditions per place. [2023-11-17 15:12:50,773 INFO L140 encePairwiseOnDemand]: 216/224 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-17 15:12:50,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2023-11-17 15:12:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-11-17 15:12:50,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-11-17 15:12:50,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-11-17 15:12:50,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-11-17 15:12:50,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:50,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-11-17 15:12:50,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:12:50,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:50,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:50,778 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 321 transitions. [2023-11-17 15:12:50,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2023-11-17 15:12:50,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:50,779 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 106 flow [2023-11-17 15:12:50,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-11-17 15:12:50,780 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-11-17 15:12:50,780 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 106 flow [2023-11-17 15:12:50,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:12:50,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:50,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:50,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:12:50,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:50,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:50,781 INFO L85 PathProgramCache]: Analyzing trace with hash 274309854, now seen corresponding path program 1 times [2023-11-17 15:12:50,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:50,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70997584] [2023-11-17 15:12:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:50,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:50,972 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:12:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70997584] [2023-11-17 15:12:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70997584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819758569] [2023-11-17 15:12:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:50,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:50,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-11-17 15:12:50,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:12:50,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:50,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-11-17 15:12:50,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:51,289 INFO L124 PetriNetUnfolderBase]: 2285/3424 cut-off events. [2023-11-17 15:12:51,289 INFO L125 PetriNetUnfolderBase]: For 1403/1403 co-relation queries the response was YES. [2023-11-17 15:12:51,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8601 conditions, 3424 events. 2285/3424 cut-off events. For 1403/1403 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15957 event pairs, 664 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8589. Up to 1760 conditions per place. [2023-11-17 15:12:51,301 INFO L140 encePairwiseOnDemand]: 216/224 looper letters, 42 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2023-11-17 15:12:51,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 268 flow [2023-11-17 15:12:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-11-17 15:12:51,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46763392857142855 [2023-11-17 15:12:51,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-11-17 15:12:51,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-11-17 15:12:51,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:51,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-11-17 15:12:51,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have 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:12:51,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:51,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:51,306 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 106 flow. Second operand 4 states and 419 transitions. [2023-11-17 15:12:51,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 268 flow [2023-11-17 15:12:51,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:51,312 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 150 flow [2023-11-17 15:12:51,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-11-17 15:12:51,314 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-11-17 15:12:51,314 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 150 flow [2023-11-17 15:12:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:12:51,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:51,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:51,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:12:51,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:51,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash -137630710, now seen corresponding path program 1 times [2023-11-17 15:12:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:51,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779655640] [2023-11-17 15:12:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:51,411 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:12:51,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:51,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779655640] [2023-11-17 15:12:51,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779655640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:51,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:51,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:12:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272635690] [2023-11-17 15:12:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:51,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:51,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 224 [2023-11-17 15:12:51,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:12:51,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:51,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 224 [2023-11-17 15:12:51,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:51,647 INFO L124 PetriNetUnfolderBase]: 1596/2556 cut-off events. [2023-11-17 15:12:51,648 INFO L125 PetriNetUnfolderBase]: For 1608/1658 co-relation queries the response was YES. [2023-11-17 15:12:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 2556 events. 1596/2556 cut-off events. For 1608/1658 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13644 event pairs, 489 based on Foata normal form. 58/2516 useless extension candidates. Maximal degree in co-relation 6432. Up to 1635 conditions per place. [2023-11-17 15:12:51,659 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 33 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-17 15:12:51,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 258 flow [2023-11-17 15:12:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-11-17 15:12:51,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49851190476190477 [2023-11-17 15:12:51,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-11-17 15:12:51,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-11-17 15:12:51,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:51,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-11-17 15:12:51,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:12:51,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:51,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:51,663 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 150 flow. Second operand 3 states and 335 transitions. [2023-11-17 15:12:51,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 258 flow [2023-11-17 15:12:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:51,666 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 161 flow [2023-11-17 15:12:51,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-17 15:12:51,666 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2023-11-17 15:12:51,667 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 161 flow [2023-11-17 15:12:51,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:12:51,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:51,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:51,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:12:51,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:51,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1135870284, now seen corresponding path program 1 times [2023-11-17 15:12:51,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:51,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921429268] [2023-11-17 15:12:51,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:51,738 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:12:51,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921429268] [2023-11-17 15:12:51,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921429268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:51,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:51,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:12:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200404329] [2023-11-17 15:12:51,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:51,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:12:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:12:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:12:51,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2023-11-17 15:12:51,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:12:51,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:51,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2023-11-17 15:12:51,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:51,893 INFO L124 PetriNetUnfolderBase]: 893/1542 cut-off events. [2023-11-17 15:12:51,893 INFO L125 PetriNetUnfolderBase]: For 1209/1231 co-relation queries the response was YES. [2023-11-17 15:12:51,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 1542 events. 893/1542 cut-off events. For 1209/1231 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7888 event pairs, 234 based on Foata normal form. 105/1622 useless extension candidates. Maximal degree in co-relation 4104. Up to 1136 conditions per place. [2023-11-17 15:12:51,900 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-11-17 15:12:51,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 336 flow [2023-11-17 15:12:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:12:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:12:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-11-17 15:12:51,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2023-11-17 15:12:51,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-11-17 15:12:51,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-11-17 15:12:51,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:51,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-11-17 15:12:51,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:12:51,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:51,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have 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:12:51,904 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 161 flow. Second operand 3 states and 333 transitions. [2023-11-17 15:12:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 336 flow [2023-11-17 15:12:51,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:51,910 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 179 flow [2023-11-17 15:12:51,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-11-17 15:12:51,912 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2023-11-17 15:12:51,912 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 179 flow [2023-11-17 15:12:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have 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:12:51,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:51,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:51,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:12:51,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1653312077, now seen corresponding path program 1 times [2023-11-17 15:12:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674345127] [2023-11-17 15:12:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:52,016 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:12:52,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:52,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674345127] [2023-11-17 15:12:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674345127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:52,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45594884] [2023-11-17 15:12:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:52,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:52,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2023-11-17 15:12:52,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:12:52,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:52,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2023-11-17 15:12:52,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,131 INFO L124 PetriNetUnfolderBase]: 471/881 cut-off events. [2023-11-17 15:12:52,132 INFO L125 PetriNetUnfolderBase]: For 569/579 co-relation queries the response was YES. [2023-11-17 15:12:52,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 881 events. 471/881 cut-off events. For 569/579 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4269 event pairs, 154 based on Foata normal form. 98/964 useless extension candidates. Maximal degree in co-relation 2681. Up to 320 conditions per place. [2023-11-17 15:12:52,136 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 54 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2023-11-17 15:12:52,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 440 flow [2023-11-17 15:12:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2023-11-17 15:12:52,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966517857142857 [2023-11-17 15:12:52,138 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2023-11-17 15:12:52,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2023-11-17 15:12:52,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:52,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2023-11-17 15:12:52,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:12:52,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:52,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:52,141 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 179 flow. Second operand 4 states and 445 transitions. [2023-11-17 15:12:52,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 440 flow [2023-11-17 15:12:52,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:52,143 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 215 flow [2023-11-17 15:12:52,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-11-17 15:12:52,145 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-11-17 15:12:52,145 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 215 flow [2023-11-17 15:12:52,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:12:52,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:52,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:52,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:12:52,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:52,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash -761509381, now seen corresponding path program 1 times [2023-11-17 15:12:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270916141] [2023-11-17 15:12:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:52,293 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:12:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270916141] [2023-11-17 15:12:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270916141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:12:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928938133] [2023-11-17 15:12:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:12:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:12:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:12:52,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 224 [2023-11-17 15:12:52,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:12:52,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:52,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 224 [2023-11-17 15:12:52,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,455 INFO L124 PetriNetUnfolderBase]: 723/1296 cut-off events. [2023-11-17 15:12:52,456 INFO L125 PetriNetUnfolderBase]: For 1757/1777 co-relation queries the response was YES. [2023-11-17 15:12:52,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 1296 events. 723/1296 cut-off events. For 1757/1777 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6508 event pairs, 181 based on Foata normal form. 16/1304 useless extension candidates. Maximal degree in co-relation 4311. Up to 628 conditions per place. [2023-11-17 15:12:52,461 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 48 selfloop transitions, 2 changer transitions 19/72 dead transitions. [2023-11-17 15:12:52,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 525 flow [2023-11-17 15:12:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:12:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:12:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-11-17 15:12:52,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2023-11-17 15:12:52,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-11-17 15:12:52,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-11-17 15:12:52,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:52,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-11-17 15:12:52,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have 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:12:52,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:52,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have 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:12:52,465 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 215 flow. Second operand 4 states and 436 transitions. [2023-11-17 15:12:52,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 525 flow [2023-11-17 15:12:52,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 491 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 15:12:52,468 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 210 flow [2023-11-17 15:12:52,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-11-17 15:12:52,468 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-11-17 15:12:52,469 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 210 flow [2023-11-17 15:12:52,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have 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:12:52,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:52,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:52,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:12:52,469 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:52,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1294159967, now seen corresponding path program 2 times [2023-11-17 15:12:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209693715] [2023-11-17 15:12:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:52,658 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:12:52,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:52,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209693715] [2023-11-17 15:12:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209693715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:52,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:52,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162445913] [2023-11-17 15:12:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:52,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:52,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 224 [2023-11-17 15:12:52,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:12:52,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:52,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 224 [2023-11-17 15:12:52,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:52,805 INFO L124 PetriNetUnfolderBase]: 515/958 cut-off events. [2023-11-17 15:12:52,805 INFO L125 PetriNetUnfolderBase]: For 949/965 co-relation queries the response was YES. [2023-11-17 15:12:52,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 958 events. 515/958 cut-off events. For 949/965 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5001 event pairs, 166 based on Foata normal form. 45/983 useless extension candidates. Maximal degree in co-relation 2978. Up to 374 conditions per place. [2023-11-17 15:12:52,808 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 40 selfloop transitions, 10 changer transitions 12/69 dead transitions. [2023-11-17 15:12:52,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 465 flow [2023-11-17 15:12:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:12:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:12:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-11-17 15:12:52,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-11-17 15:12:52,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-11-17 15:12:52,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-11-17 15:12:52,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:52,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-11-17 15:12:52,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have 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:12:52,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have 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:12:52,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have 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:12:52,812 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 210 flow. Second operand 5 states and 544 transitions. [2023-11-17 15:12:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 465 flow [2023-11-17 15:12:52,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 446 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-17 15:12:52,815 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 198 flow [2023-11-17 15:12:52,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-11-17 15:12:52,815 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-11-17 15:12:52,816 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 198 flow [2023-11-17 15:12:52,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:12:52,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:52,816 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:12:52,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:12:52,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:52,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 664400060, now seen corresponding path program 1 times [2023-11-17 15:12:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685229206] [2023-11-17 15:12:52,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:53,162 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:12:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685229206] [2023-11-17 15:12:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685229206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:12:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089458542] [2023-11-17 15:12:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:12:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:12:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:12:53,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 224 [2023-11-17 15:12:53,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have 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:12:53,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:53,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 224 [2023-11-17 15:12:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:53,418 INFO L124 PetriNetUnfolderBase]: 609/1160 cut-off events. [2023-11-17 15:12:53,418 INFO L125 PetriNetUnfolderBase]: For 1929/1929 co-relation queries the response was YES. [2023-11-17 15:12:53,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 1160 events. 609/1160 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6132 event pairs, 72 based on Foata normal form. 1/1161 useless extension candidates. Maximal degree in co-relation 3995. Up to 339 conditions per place. [2023-11-17 15:12:53,423 INFO L140 encePairwiseOnDemand]: 211/224 looper letters, 60 selfloop transitions, 26 changer transitions 36/122 dead transitions. [2023-11-17 15:12:53,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 122 transitions, 902 flow [2023-11-17 15:12:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 719 transitions. [2023-11-17 15:12:53,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585459183673469 [2023-11-17 15:12:53,425 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 719 transitions. [2023-11-17 15:12:53,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 719 transitions. [2023-11-17 15:12:53,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:53,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 719 transitions. [2023-11-17 15:12:53,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have 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:12:53,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have 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:12:53,429 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have 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:12:53,429 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 198 flow. Second operand 7 states and 719 transitions. [2023-11-17 15:12:53,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 122 transitions, 902 flow [2023-11-17 15:12:53,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 122 transitions, 808 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-11-17 15:12:53,437 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 367 flow [2023-11-17 15:12:53,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-11-17 15:12:53,437 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-11-17 15:12:53,437 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 367 flow [2023-11-17 15:12:53,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have 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:12:53,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:53,438 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:12:53,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:12:53,438 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:53,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1962408752, now seen corresponding path program 2 times [2023-11-17 15:12:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482315551] [2023-11-17 15:12:53,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:53,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:12:53,878 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:12:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:12:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482315551] [2023-11-17 15:12:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482315551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:12:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:12:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 15:12:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457224555] [2023-11-17 15:12:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:12:53,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 15:12:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:12:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 15:12:53,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 15:12:53,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 224 [2023-11-17 15:12:53,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:12:53,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:12:53,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 224 [2023-11-17 15:12:53,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:12:54,101 INFO L124 PetriNetUnfolderBase]: 423/922 cut-off events. [2023-11-17 15:12:54,101 INFO L125 PetriNetUnfolderBase]: For 2002/2026 co-relation queries the response was YES. [2023-11-17 15:12:54,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3828 conditions, 922 events. 423/922 cut-off events. For 2002/2026 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5305 event pairs, 63 based on Foata normal form. 6/925 useless extension candidates. Maximal degree in co-relation 3803. Up to 482 conditions per place. [2023-11-17 15:12:54,105 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 43 selfloop transitions, 5 changer transitions 33/91 dead transitions. [2023-11-17 15:12:54,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 746 flow [2023-11-17 15:12:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:12:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:12:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 709 transitions. [2023-11-17 15:12:54,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45216836734693877 [2023-11-17 15:12:54,107 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 709 transitions. [2023-11-17 15:12:54,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 709 transitions. [2023-11-17 15:12:54,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:12:54,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 709 transitions. [2023-11-17 15:12:54,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have 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:12:54,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have 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:12:54,110 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have 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:12:54,110 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 367 flow. Second operand 7 states and 709 transitions. [2023-11-17 15:12:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 746 flow [2023-11-17 15:12:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 720 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:12:54,118 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 306 flow [2023-11-17 15:12:54,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-11-17 15:12:54,119 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2023-11-17 15:12:54,119 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 306 flow [2023-11-17 15:12:54,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have 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:12:54,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:12:54,119 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:12:54,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:12:54,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:12:54,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:12:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 763402610, now seen corresponding path program 3 times [2023-11-17 15:12:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:12:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570595439] [2023-11-17 15:12:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:12:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:12:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:54,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:12:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:12:54,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:12:54,193 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:12:54,194 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:12:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:12:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:12:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:12:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:12:54,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:12:54,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:12:54,196 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 15:12:54,199 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:12:54,199 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:12:54,236 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:12:54,238 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:12:54,239 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:12:54,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:12:54 BasicIcfg [2023-11-17 15:12:54,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:12:54,256 INFO L158 Benchmark]: Toolchain (without parser) took 8984.10ms. Allocated memory was 295.7MB in the beginning and 468.7MB in the end (delta: 173.0MB). Free memory was 250.0MB in the beginning and 360.2MB in the end (delta: -110.2MB). Peak memory consumption was 63.8MB. Max. memory is 8.0GB. [2023-11-17 15:12:54,256 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:12:54,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.16ms. Allocated memory is still 295.7MB. Free memory was 249.5MB in the beginning and 225.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:54,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 295.7MB. Free memory was 225.9MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:54,261 INFO L158 Benchmark]: Boogie Preprocessor took 22.82ms. Allocated memory is still 295.7MB. Free memory was 223.8MB in the beginning and 221.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:12:54,261 INFO L158 Benchmark]: RCFGBuilder took 488.63ms. Allocated memory is still 295.7MB. Free memory was 221.7MB in the beginning and 185.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-11-17 15:12:54,261 INFO L158 Benchmark]: TraceAbstraction took 7990.68ms. Allocated memory was 295.7MB in the beginning and 468.7MB in the end (delta: 173.0MB). Free memory was 184.4MB in the beginning and 360.2MB in the end (delta: -175.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:12:54,262 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.12ms. Allocated memory is still 184.5MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.16ms. Allocated memory is still 295.7MB. Free memory was 249.5MB in the beginning and 225.9MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 295.7MB. Free memory was 225.9MB in the beginning and 223.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.82ms. Allocated memory is still 295.7MB. Free memory was 223.8MB in the beginning and 221.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.63ms. Allocated memory is still 295.7MB. Free memory was 221.7MB in the beginning and 185.5MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7990.68ms. Allocated memory was 295.7MB in the beginning and 468.7MB in the end (delta: 173.0MB). Free memory was 184.4MB in the beginning and 360.2MB in the end (delta: -175.8MB). There was no memory consumed. 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 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: 3.2s, 122 PlacesBefore, 35 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6879 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3462, independent: 3258, independent conditional: 0, independent unconditional: 3258, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1963, independent: 1904, independent conditional: 0, independent unconditional: 1904, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1963, independent: 1857, independent conditional: 0, independent unconditional: 1857, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 106, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3462, independent: 1354, independent conditional: 0, independent unconditional: 1354, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1963, unknown conditional: 0, unknown unconditional: 1963] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 17 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:12:54,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...