/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:46:48,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:46:48,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:46:48,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:46:48,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:46:48,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:46:48,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:46:48,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:46:48,810 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:46:48,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:46:48,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:46:48,813 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:46:48,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:46:48,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:46:48,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:46:48,815 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:46:48,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:46:48,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:46:48,816 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:46:48,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:46:48,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:46:48,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:46:48,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:46:48,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:46:48,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:46:48,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:46:48,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:46:48,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:46:48,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:46:48,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:46:49,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:46:49,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:46:49,013 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:46:49,013 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:46:49,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:46:50,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:46:50,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:46:50,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:46:50,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc5dd0af/a852a439210144bdb9b3a04e494345f2/FLAG6f25ce6d4 [2023-11-10 11:46:50,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc5dd0af/a852a439210144bdb9b3a04e494345f2 [2023-11-10 11:46:50,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:46:50,215 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:46:50,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:46:50,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:46:50,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:46:50,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575b4169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50, skipping insertion in model container [2023-11-10 11:46:50,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:46:50,366 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-10 11:46:50,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:46:50,553 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:46:50,562 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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2023-11-10 11:46:50,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:46:50,630 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:46:50,631 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:46:50,636 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:46:50,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50 WrapperNode [2023-11-10 11:46:50,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:46:50,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:46:50,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:46:50,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:46:50,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,693 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-11-10 11:46:50,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:46:50,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:46:50,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:46:50,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:46:50,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:46:50,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:46:50,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:46:50,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:46:50,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (1/1) ... [2023-11-10 11:46:50,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:46:50,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:46:50,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:46:50,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:46:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:46:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:46:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:46:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:46:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:46:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:46:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:46:50,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:46:50,833 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:46:50,930 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:46:50,932 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:46:51,114 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:46:51,210 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:46:51,211 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:46:51,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:51 BoogieIcfgContainer [2023-11-10 11:46:51,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:46:51,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:46:51,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:46:51,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:46:51,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:46:50" (1/3) ... [2023-11-10 11:46:51,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e5634c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:51, skipping insertion in model container [2023-11-10 11:46:51,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:46:50" (2/3) ... [2023-11-10 11:46:51,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e5634c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:46:51, skipping insertion in model container [2023-11-10 11:46:51,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:51" (3/3) ... [2023-11-10 11:46:51,220 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-10 11:46:51,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:46:51,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:46:51,232 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:46:51,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:46:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 190 flow [2023-11-10 11:46:51,368 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-11-10 11:46:51,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:46:51,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2023-11-10 11:46:51,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 190 flow [2023-11-10 11:46:51,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 89 transitions, 184 flow [2023-11-10 11:46:51,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:46:51,423 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;@5b60be72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:46:51,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:46:51,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:46:51,430 INFO L124 PetriNetUnfolderBase]: 1/40 cut-off events. [2023-11-10 11:46:51,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:46:51,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:51,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:51,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:51,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash -466496834, now seen corresponding path program 1 times [2023-11-10 11:46:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817573745] [2023-11-10 11:46:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817573745] [2023-11-10 11:46:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817573745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:46:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140247693] [2023-11-10 11:46:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:46:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:51,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:46:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:46:51,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2023-11-10 11:46:51,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:51,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:51,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2023-11-10 11:46:51,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:51,944 INFO L124 PetriNetUnfolderBase]: 18/165 cut-off events. [2023-11-10 11:46:51,945 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-10 11:46:51,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 165 events. 18/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 434 event pairs, 5 based on Foata normal form. 8/165 useless extension candidates. Maximal degree in co-relation 174. Up to 31 conditions per place. [2023-11-10 11:46:51,947 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 10 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-10 11:46:51,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 88 transitions, 209 flow [2023-11-10 11:46:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:46:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:46:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-11-10 11:46:51,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-11-10 11:46:51,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-11-10 11:46:51,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-11-10 11:46:51,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:51,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-11-10 11:46:51,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:51,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:51,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:51,979 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 184 flow. Second operand 3 states and 252 transitions. [2023-11-10 11:46:51,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 88 transitions, 209 flow [2023-11-10 11:46:51,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 88 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:46:51,987 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 176 flow [2023-11-10 11:46:51,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2023-11-10 11:46:51,994 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2023-11-10 11:46:51,995 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 176 flow [2023-11-10 11:46:51,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:51,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:51,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:51,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:46:51,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:51,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash -568077213, now seen corresponding path program 1 times [2023-11-10 11:46:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786377136] [2023-11-10 11:46:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786377136] [2023-11-10 11:46:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786377136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:52,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:52,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:46:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105630822] [2023-11-10 11:46:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:52,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:46:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:46:52,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:46:52,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2023-11-10 11:46:52,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:52,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:52,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2023-11-10 11:46:52,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:53,258 INFO L124 PetriNetUnfolderBase]: 231/646 cut-off events. [2023-11-10 11:46:53,259 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-10 11:46:53,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 646 events. 231/646 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3425 event pairs, 52 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 1091. Up to 208 conditions per place. [2023-11-10 11:46:53,265 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 23 selfloop transitions, 2 changer transitions 45/121 dead transitions. [2023-11-10 11:46:53,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 121 transitions, 388 flow [2023-11-10 11:46:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:46:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:46:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 613 transitions. [2023-11-10 11:46:53,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7484737484737485 [2023-11-10 11:46:53,270 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 613 transitions. [2023-11-10 11:46:53,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 613 transitions. [2023-11-10 11:46:53,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:53,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 613 transitions. [2023-11-10 11:46:53,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.11111111111111) internal successors, (613), 9 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:53,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:53,275 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:53,275 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 176 flow. Second operand 9 states and 613 transitions. [2023-11-10 11:46:53,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 121 transitions, 388 flow [2023-11-10 11:46:53,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:46:53,279 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 170 flow [2023-11-10 11:46:53,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2023-11-10 11:46:53,280 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 11 predicate places. [2023-11-10 11:46:53,280 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 170 flow [2023-11-10 11:46:53,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:53,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:53,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:53,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:46:53,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:53,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1664455260, now seen corresponding path program 1 times [2023-11-10 11:46:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928286387] [2023-11-10 11:46:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928286387] [2023-11-10 11:46:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928286387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:53,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:46:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916087361] [2023-11-10 11:46:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:53,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:46:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:53,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:46:53,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:46:53,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 91 [2023-11-10 11:46:53,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:53,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:53,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 91 [2023-11-10 11:46:53,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:54,410 INFO L124 PetriNetUnfolderBase]: 225/564 cut-off events. [2023-11-10 11:46:54,411 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-11-10 11:46:54,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 564 events. 225/564 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2755 event pairs, 25 based on Foata normal form. 16/561 useless extension candidates. Maximal degree in co-relation 1101. Up to 129 conditions per place. [2023-11-10 11:46:54,414 INFO L140 encePairwiseOnDemand]: 78/91 looper letters, 31 selfloop transitions, 12 changer transitions 56/148 dead transitions. [2023-11-10 11:46:54,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 148 transitions, 573 flow [2023-11-10 11:46:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:46:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:46:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1106 transitions. [2023-11-10 11:46:54,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7149321266968326 [2023-11-10 11:46:54,417 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1106 transitions. [2023-11-10 11:46:54,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1106 transitions. [2023-11-10 11:46:54,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:54,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1106 transitions. [2023-11-10 11:46:54,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 65.05882352941177) internal successors, (1106), 17 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:54,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 91.0) internal successors, (1638), 18 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:54,423 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 91.0) internal successors, (1638), 18 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:54,423 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 170 flow. Second operand 17 states and 1106 transitions. [2023-11-10 11:46:54,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 148 transitions, 573 flow [2023-11-10 11:46:54,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 148 transitions, 511 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-11-10 11:46:54,430 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 280 flow [2023-11-10 11:46:54,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=280, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2023-11-10 11:46:54,431 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 17 predicate places. [2023-11-10 11:46:54,432 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 81 transitions, 280 flow [2023-11-10 11:46:54,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 61.714285714285715) internal successors, (432), 7 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:54,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:54,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:54,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:46:54,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:54,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash -157427612, now seen corresponding path program 2 times [2023-11-10 11:46:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463125914] [2023-11-10 11:46:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463125914] [2023-11-10 11:46:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463125914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:54,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:54,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:46:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374039700] [2023-11-10 11:46:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:54,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:46:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:46:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:46:54,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 91 [2023-11-10 11:46:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 81 transitions, 280 flow. Second operand has 8 states, 8 states have (on average 61.375) internal successors, (491), 8 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 91 [2023-11-10 11:46:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:55,133 INFO L124 PetriNetUnfolderBase]: 161/403 cut-off events. [2023-11-10 11:46:55,133 INFO L125 PetriNetUnfolderBase]: For 1891/2543 co-relation queries the response was YES. [2023-11-10 11:46:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 403 events. 161/403 cut-off events. For 1891/2543 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1606 event pairs, 33 based on Foata normal form. 16/395 useless extension candidates. Maximal degree in co-relation 1584. Up to 127 conditions per place. [2023-11-10 11:46:55,135 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 24 selfloop transitions, 4 changer transitions 41/118 dead transitions. [2023-11-10 11:46:55,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 739 flow [2023-11-10 11:46:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:46:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:46:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 654 transitions. [2023-11-10 11:46:55,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7186813186813187 [2023-11-10 11:46:55,138 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 654 transitions. [2023-11-10 11:46:55,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 654 transitions. [2023-11-10 11:46:55,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:55,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 654 transitions. [2023-11-10 11:46:55,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 65.4) internal successors, (654), 10 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,141 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,141 INFO L175 Difference]: Start difference. First operand has 110 places, 81 transitions, 280 flow. Second operand 10 states and 654 transitions. [2023-11-10 11:46:55,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 739 flow [2023-11-10 11:46:55,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 118 transitions, 703 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-11-10 11:46:55,146 INFO L231 Difference]: Finished difference. Result has 108 places, 73 transitions, 250 flow [2023-11-10 11:46:55,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=73} [2023-11-10 11:46:55,147 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 15 predicate places. [2023-11-10 11:46:55,147 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 73 transitions, 250 flow [2023-11-10 11:46:55,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.375) internal successors, (491), 8 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:55,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:55,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:46:55,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:55,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1109409678, now seen corresponding path program 1 times [2023-11-10 11:46:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:55,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529719192] [2023-11-10 11:46:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:55,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529719192] [2023-11-10 11:46:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529719192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:46:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276809459] [2023-11-10 11:46:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:46:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:46:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:46:55,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2023-11-10 11:46:55,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 73 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 66.5) internal successors, (665), 10 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:55,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2023-11-10 11:46:55,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:55,757 INFO L124 PetriNetUnfolderBase]: 60/232 cut-off events. [2023-11-10 11:46:55,757 INFO L125 PetriNetUnfolderBase]: For 1052/1065 co-relation queries the response was YES. [2023-11-10 11:46:55,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 232 events. 60/232 cut-off events. For 1052/1065 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 706 event pairs, 18 based on Foata normal form. 6/232 useless extension candidates. Maximal degree in co-relation 795. Up to 73 conditions per place. [2023-11-10 11:46:55,759 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 17 selfloop transitions, 7 changer transitions 22/101 dead transitions. [2023-11-10 11:46:55,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 101 transitions, 556 flow [2023-11-10 11:46:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:46:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:46:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 893 transitions. [2023-11-10 11:46:55,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7548605240912933 [2023-11-10 11:46:55,762 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 893 transitions. [2023-11-10 11:46:55,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 893 transitions. [2023-11-10 11:46:55,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:55,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 893 transitions. [2023-11-10 11:46:55,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.6923076923077) internal successors, (893), 13 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,765 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 91.0) internal successors, (1274), 14 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,765 INFO L175 Difference]: Start difference. First operand has 108 places, 73 transitions, 250 flow. Second operand 13 states and 893 transitions. [2023-11-10 11:46:55,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 101 transitions, 556 flow [2023-11-10 11:46:55,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 494 flow, removed 22 selfloop flow, removed 14 redundant places. [2023-11-10 11:46:55,769 INFO L231 Difference]: Finished difference. Result has 107 places, 75 transitions, 267 flow [2023-11-10 11:46:55,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=267, PETRI_PLACES=107, PETRI_TRANSITIONS=75} [2023-11-10 11:46:55,769 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 14 predicate places. [2023-11-10 11:46:55,769 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 75 transitions, 267 flow [2023-11-10 11:46:55,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.5) internal successors, (665), 10 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:55,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:55,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:46:55,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:55,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 988089046, now seen corresponding path program 1 times [2023-11-10 11:46:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766698835] [2023-11-10 11:46:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:56,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:56,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766698835] [2023-11-10 11:46:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766698835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 11:46:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893921732] [2023-11-10 11:46:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:56,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:46:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:46:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:46:56,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 91 [2023-11-10 11:46:56,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 75 transitions, 267 flow. Second operand has 10 states, 10 states have (on average 61.2) internal successors, (612), 10 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:56,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 91 [2023-11-10 11:46:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:56,791 INFO L124 PetriNetUnfolderBase]: 289/685 cut-off events. [2023-11-10 11:46:56,791 INFO L125 PetriNetUnfolderBase]: For 4017/4021 co-relation queries the response was YES. [2023-11-10 11:46:56,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 685 events. 289/685 cut-off events. For 4017/4021 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3354 event pairs, 56 based on Foata normal form. 2/672 useless extension candidates. Maximal degree in co-relation 2572. Up to 195 conditions per place. [2023-11-10 11:46:56,796 INFO L140 encePairwiseOnDemand]: 77/91 looper letters, 62 selfloop transitions, 12 changer transitions 58/178 dead transitions. [2023-11-10 11:46:56,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 178 transitions, 1127 flow [2023-11-10 11:46:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:46:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:46:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1255 transitions. [2023-11-10 11:46:56,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7258530942741469 [2023-11-10 11:46:56,799 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1255 transitions. [2023-11-10 11:46:56,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1255 transitions. [2023-11-10 11:46:56,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:56,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1255 transitions. [2023-11-10 11:46:56,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 66.05263157894737) internal successors, (1255), 19 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 91.0) internal successors, (1820), 20 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,805 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 91.0) internal successors, (1820), 20 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,805 INFO L175 Difference]: Start difference. First operand has 107 places, 75 transitions, 267 flow. Second operand 19 states and 1255 transitions. [2023-11-10 11:46:56,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 178 transitions, 1127 flow [2023-11-10 11:46:56,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 178 transitions, 1002 flow, removed 57 selfloop flow, removed 11 redundant places. [2023-11-10 11:46:56,813 INFO L231 Difference]: Finished difference. Result has 122 places, 81 transitions, 384 flow [2023-11-10 11:46:56,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=384, PETRI_PLACES=122, PETRI_TRANSITIONS=81} [2023-11-10 11:46:56,816 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 29 predicate places. [2023-11-10 11:46:56,816 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 81 transitions, 384 flow [2023-11-10 11:46:56,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.2) internal successors, (612), 10 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:46:56,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:56,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1815824442, now seen corresponding path program 2 times [2023-11-10 11:46:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709455458] [2023-11-10 11:46:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:56,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709455458] [2023-11-10 11:46:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709455458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:46:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140461963] [2023-11-10 11:46:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:56,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:46:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:46:56,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:46:56,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2023-11-10 11:46:56,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 81 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:56,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:56,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2023-11-10 11:46:56,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:57,089 INFO L124 PetriNetUnfolderBase]: 124/357 cut-off events. [2023-11-10 11:46:57,090 INFO L125 PetriNetUnfolderBase]: For 3740/3754 co-relation queries the response was YES. [2023-11-10 11:46:57,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 357 events. 124/357 cut-off events. For 3740/3754 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1337 event pairs, 16 based on Foata normal form. 15/365 useless extension candidates. Maximal degree in co-relation 1644. Up to 97 conditions per place. [2023-11-10 11:46:57,092 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 26 selfloop transitions, 6 changer transitions 35/123 dead transitions. [2023-11-10 11:46:57,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 123 transitions, 1050 flow [2023-11-10 11:46:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:46:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:46:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 657 transitions. [2023-11-10 11:46:57,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2023-11-10 11:46:57,095 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 657 transitions. [2023-11-10 11:46:57,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 657 transitions. [2023-11-10 11:46:57,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:57,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 657 transitions. [2023-11-10 11:46:57,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.0) internal successors, (657), 9 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,098 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,098 INFO L175 Difference]: Start difference. First operand has 122 places, 81 transitions, 384 flow. Second operand 9 states and 657 transitions. [2023-11-10 11:46:57,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 123 transitions, 1050 flow [2023-11-10 11:46:57,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 123 transitions, 884 flow, removed 80 selfloop flow, removed 7 redundant places. [2023-11-10 11:46:57,105 INFO L231 Difference]: Finished difference. Result has 116 places, 81 transitions, 354 flow [2023-11-10 11:46:57,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=116, PETRI_TRANSITIONS=81} [2023-11-10 11:46:57,105 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 23 predicate places. [2023-11-10 11:46:57,106 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 81 transitions, 354 flow [2023-11-10 11:46:57,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:57,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:57,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:46:57,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:57,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2080667917, now seen corresponding path program 1 times [2023-11-10 11:46:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128437897] [2023-11-10 11:46:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128437897] [2023-11-10 11:46:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128437897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:46:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379087550] [2023-11-10 11:46:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:57,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:46:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:46:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:46:57,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2023-11-10 11:46:57,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 81 transitions, 354 flow. Second operand has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:57,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2023-11-10 11:46:57,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:57,352 INFO L124 PetriNetUnfolderBase]: 28/151 cut-off events. [2023-11-10 11:46:57,352 INFO L125 PetriNetUnfolderBase]: For 876/877 co-relation queries the response was YES. [2023-11-10 11:46:57,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 151 events. 28/151 cut-off events. For 876/877 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 324 event pairs, 6 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 525. Up to 22 conditions per place. [2023-11-10 11:46:57,354 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 20 selfloop transitions, 8 changer transitions 15/99 dead transitions. [2023-11-10 11:46:57,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 99 transitions, 649 flow [2023-11-10 11:46:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:46:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:46:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 710 transitions. [2023-11-10 11:46:57,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2023-11-10 11:46:57,356 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 710 transitions. [2023-11-10 11:46:57,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 710 transitions. [2023-11-10 11:46:57,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:57,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 710 transitions. [2023-11-10 11:46:57,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 71.0) internal successors, (710), 10 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,359 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 91.0) internal successors, (1001), 11 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,359 INFO L175 Difference]: Start difference. First operand has 116 places, 81 transitions, 354 flow. Second operand 10 states and 710 transitions. [2023-11-10 11:46:57,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 99 transitions, 649 flow [2023-11-10 11:46:57,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 455 flow, removed 85 selfloop flow, removed 18 redundant places. [2023-11-10 11:46:57,362 INFO L231 Difference]: Finished difference. Result has 109 places, 81 transitions, 296 flow [2023-11-10 11:46:57,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=109, PETRI_TRANSITIONS=81} [2023-11-10 11:46:57,364 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 16 predicate places. [2023-11-10 11:46:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 81 transitions, 296 flow [2023-11-10 11:46:57,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.28571428571429) internal successors, (485), 7 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:57,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:57,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:46:57,366 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:57,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1695886976, now seen corresponding path program 1 times [2023-11-10 11:46:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074190094] [2023-11-10 11:46:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074190094] [2023-11-10 11:46:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074190094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-10 11:46:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775600964] [2023-11-10 11:46:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:58,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-10 11:46:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-10 11:46:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-10 11:46:58,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 91 [2023-11-10 11:46:58,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 81 transitions, 296 flow. Second operand has 11 states, 11 states have (on average 61.18181818181818) internal successors, (673), 11 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:58,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:58,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 91 [2023-11-10 11:46:58,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:58,189 INFO L124 PetriNetUnfolderBase]: 8/121 cut-off events. [2023-11-10 11:46:58,190 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-11-10 11:46:58,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 121 events. 8/121 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 1 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 261. Up to 19 conditions per place. [2023-11-10 11:46:58,190 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 22 selfloop transitions, 6 changer transitions 9/88 dead transitions. [2023-11-10 11:46:58,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 394 flow [2023-11-10 11:46:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:46:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:46:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 564 transitions. [2023-11-10 11:46:58,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6886446886446886 [2023-11-10 11:46:58,192 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 564 transitions. [2023-11-10 11:46:58,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 564 transitions. [2023-11-10 11:46:58,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:46:58,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 564 transitions. [2023-11-10 11:46:58,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 62.666666666666664) internal successors, (564), 9 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:58,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:58,195 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:58,195 INFO L175 Difference]: Start difference. First operand has 109 places, 81 transitions, 296 flow. Second operand 9 states and 564 transitions. [2023-11-10 11:46:58,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 394 flow [2023-11-10 11:46:58,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 88 transitions, 317 flow, removed 23 selfloop flow, removed 18 redundant places. [2023-11-10 11:46:58,197 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 227 flow [2023-11-10 11:46:58,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2023-11-10 11:46:58,198 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2023-11-10 11:46:58,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 78 transitions, 227 flow [2023-11-10 11:46:58,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 61.18181818181818) internal successors, (673), 11 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:58,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:58,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:58,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:46:58,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-10 11:46:58,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash 887470380, now seen corresponding path program 2 times [2023-11-10 11:46:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416212592] [2023-11-10 11:46:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:46:58,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:46:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:46:58,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:46:58,290 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:46:58,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-10 11:46:58,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:46:58,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-10 11:46:58,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-10 11:46:58,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:46:58,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:46:58,296 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-11-10 11:46:58,302 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:46:58,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:46:58,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-10 11:46:58,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:46:58,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:46:58 BasicIcfg [2023-11-10 11:46:58,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:46:58,369 INFO L158 Benchmark]: Toolchain (without parser) took 8154.46ms. Allocated memory was 289.4MB in the beginning and 502.3MB in the end (delta: 212.9MB). Free memory was 249.1MB in the beginning and 196.4MB in the end (delta: 52.7MB). Peak memory consumption was 267.1MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,370 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory was 144.1MB in the beginning and 143.9MB in the end (delta: 150.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:46:58,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.13ms. Allocated memory is still 289.4MB. Free memory was 249.1MB in the beginning and 226.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.22ms. Allocated memory is still 289.4MB. Free memory was 226.5MB in the beginning and 223.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,370 INFO L158 Benchmark]: Boogie Preprocessor took 34.71ms. Allocated memory is still 289.4MB. Free memory was 223.9MB in the beginning and 221.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,370 INFO L158 Benchmark]: RCFGBuilder took 483.99ms. Allocated memory is still 289.4MB. Free memory was 221.8MB in the beginning and 187.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,371 INFO L158 Benchmark]: TraceAbstraction took 7154.07ms. Allocated memory was 289.4MB in the beginning and 502.3MB in the end (delta: 212.9MB). Free memory was 187.2MB in the beginning and 196.4MB in the end (delta: -9.1MB). Peak memory consumption was 205.2MB. Max. memory is 8.0GB. [2023-11-10 11:46:58,372 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 191.9MB. Free memory was 144.1MB in the beginning and 143.9MB in the end (delta: 150.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.13ms. Allocated memory is still 289.4MB. Free memory was 249.1MB in the beginning and 226.5MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.22ms. Allocated memory is still 289.4MB. Free memory was 226.5MB in the beginning and 223.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.71ms. Allocated memory is still 289.4MB. Free memory was 223.9MB in the beginning and 221.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 483.99ms. Allocated memory is still 289.4MB. Free memory was 221.8MB in the beginning and 187.7MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 7154.07ms. Allocated memory was 289.4MB in the beginning and 502.3MB in the end (delta: 212.9MB). Free memory was 187.2MB in the beginning and 196.4MB in the end (delta: -9.1MB). Peak memory consumption was 205.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 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: 793]: 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: 795]: 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 5 procedures, 108 locations, 5 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.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 656 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 515 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 999 IncrementalHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 141 mSDtfsCounter, 999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=6, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 2943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-10 11:46:58,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...