/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:26:06,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:26:06,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:26:06,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:26:06,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:26:06,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:26:06,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:26:06,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:26:06,410 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:26:06,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:26:06,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:26:06,410 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:26:06,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:26:06,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:26:06,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:26:06,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:26:06,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:26:06,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:26:06,412 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:26:06,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:26:06,413 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:26:06,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:26:06,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:26:06,414 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:26:06,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:26:06,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:06,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:26:06,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:26:06,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:26:06,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:26:06,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:26:06,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:26:06,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:26:06,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:26:06,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:26:06,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:26:06,633 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:26:06,634 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:26:06,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-17 11:26:07,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:26:07,800 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:26:07,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-11-17 11:26:07,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6d0e084/e313eebdb4db4c82a46736b18aff190c/FLAG0a9579997 [2023-11-17 11:26:07,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6d0e084/e313eebdb4db4c82a46736b18aff190c [2023-11-17 11:26:07,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:26:07,827 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:26:07,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:07,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:26:07,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:26:07,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:07" (1/1) ... [2023-11-17 11:26:07,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681f3fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:07, skipping insertion in model container [2023-11-17 11:26:07,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:07" (1/1) ... [2023-11-17 11:26:07,875 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:26:07,980 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/mix034_pso.opt_tso.opt.i[999,1012] [2023-11-17 11:26:08,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:08,143 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:26:08,152 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/mix034_pso.opt_tso.opt.i[999,1012] [2023-11-17 11:26:08,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:08,215 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:08,215 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:08,220 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:26:08,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08 WrapperNode [2023-11-17 11:26:08,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:08,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:08,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:26:08,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:26:08,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,279 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2023-11-17 11:26:08,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:08,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:26:08,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:26:08,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:26:08,287 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:26:08,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:26:08,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:26:08,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:26:08,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (1/1) ... [2023-11-17 11:26:08,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:26:08,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:26:08,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:26:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:26:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:26:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:26:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:26:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:26:08,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:26:08,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:26:08,384 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:26:08,478 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:26:08,479 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:26:08,737 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:26:08,831 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:26:08,831 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:26:08,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:08 BoogieIcfgContainer [2023-11-17 11:26:08,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:26:08,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:26:08,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:26:08,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:26:08,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:26:07" (1/3) ... [2023-11-17 11:26:08,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf4ba6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:08, skipping insertion in model container [2023-11-17 11:26:08,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:08" (2/3) ... [2023-11-17 11:26:08,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf4ba6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:08, skipping insertion in model container [2023-11-17 11:26:08,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:08" (3/3) ... [2023-11-17 11:26:08,838 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2023-11-17 11:26:08,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:26:08,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:26:08,851 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:26:08,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:26:08,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 72 flow [2023-11-17 11:26:08,934 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-11-17 11:26:08,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:08,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-11-17 11:26:08,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 32 transitions, 72 flow [2023-11-17 11:26:08,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 30 transitions, 66 flow [2023-11-17 11:26:08,946 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:26:08,958 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 66 flow [2023-11-17 11:26:08,960 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 66 flow [2023-11-17 11:26:08,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 66 flow [2023-11-17 11:26:08,966 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-11-17 11:26:08,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:08,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-11-17 11:26:08,967 INFO L119 LiptonReduction]: Number of co-enabled transitions 462 [2023-11-17 11:26:09,816 INFO L134 LiptonReduction]: Checked pairs total: 931 [2023-11-17 11:26:09,816 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-11-17 11:26:09,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:26:09,835 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;@693b40c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:26:09,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:26:09,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:26:09,839 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-17 11:26:09,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:09,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:09,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:26:09,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:09,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash 301164135, now seen corresponding path program 1 times [2023-11-17 11:26:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:09,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408857331] [2023-11-17 11:26:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408857331] [2023-11-17 11:26:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408857331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:10,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:10,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724201057] [2023-11-17 11:26:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:10,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:10,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 50 [2023-11-17 11:26:10,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:10,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 50 [2023-11-17 11:26:10,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:10,348 INFO L124 PetriNetUnfolderBase]: 142/271 cut-off events. [2023-11-17 11:26:10,348 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:26:10,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 271 events. 142/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 983 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 526. Up to 205 conditions per place. [2023-11-17 11:26:10,351 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-11-17 11:26:10,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 96 flow [2023-11-17 11:26:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2023-11-17 11:26:10,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-11-17 11:26:10,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 71 transitions. [2023-11-17 11:26:10,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 71 transitions. [2023-11-17 11:26:10,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:10,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 71 transitions. [2023-11-17 11:26:10,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,373 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 71 transitions. [2023-11-17 11:26:10,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 23 transitions, 96 flow [2023-11-17 11:26:10,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:10,376 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-11-17 11:26:10,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-11-17 11:26:10,381 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:26:10,382 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-11-17 11:26:10,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:10,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:10,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:26:10,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:10,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1655938740, now seen corresponding path program 1 times [2023-11-17 11:26:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206761120] [2023-11-17 11:26:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206761120] [2023-11-17 11:26:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206761120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:10,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:10,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470607727] [2023-11-17 11:26:10,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:10,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:10,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2023-11-17 11:26:10,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:10,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2023-11-17 11:26:10,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:10,645 INFO L124 PetriNetUnfolderBase]: 127/228 cut-off events. [2023-11-17 11:26:10,646 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-17 11:26:10,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 228 events. 127/228 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 718 event pairs, 43 based on Foata normal form. 4/232 useless extension candidates. Maximal degree in co-relation 474. Up to 201 conditions per place. [2023-11-17 11:26:10,650 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-11-17 11:26:10,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 104 flow [2023-11-17 11:26:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2023-11-17 11:26:10,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2023-11-17 11:26:10,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 63 transitions. [2023-11-17 11:26:10,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 63 transitions. [2023-11-17 11:26:10,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:10,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 63 transitions. [2023-11-17 11:26:10,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,657 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 63 transitions. [2023-11-17 11:26:10,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 104 flow [2023-11-17 11:26:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:10,659 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-11-17 11:26:10,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-11-17 11:26:10,660 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 11:26:10,660 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-11-17 11:26:10,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:10,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:10,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:26:10,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:10,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1603251973, now seen corresponding path program 1 times [2023-11-17 11:26:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335440446] [2023-11-17 11:26:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:10,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:10,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335440446] [2023-11-17 11:26:10,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335440446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717563233] [2023-11-17 11:26:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:10,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:10,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2023-11-17 11:26:10,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:10,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2023-11-17 11:26:10,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:10,913 INFO L124 PetriNetUnfolderBase]: 97/190 cut-off events. [2023-11-17 11:26:10,913 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-17 11:26:10,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 190 events. 97/190 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 430. Up to 117 conditions per place. [2023-11-17 11:26:10,914 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 17 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2023-11-17 11:26:10,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 101 flow [2023-11-17 11:26:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2023-11-17 11:26:10,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2023-11-17 11:26:10,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 62 transitions. [2023-11-17 11:26:10,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 62 transitions. [2023-11-17 11:26:10,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:10,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 62 transitions. [2023-11-17 11:26:10,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,917 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 62 transitions. [2023-11-17 11:26:10,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 101 flow [2023-11-17 11:26:10,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:10,918 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 61 flow [2023-11-17 11:26:10,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-17 11:26:10,919 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-11-17 11:26:10,919 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 61 flow [2023-11-17 11:26:10,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:10,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:10,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:10,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:26:10,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:10,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2075676781, now seen corresponding path program 1 times [2023-11-17 11:26:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764318009] [2023-11-17 11:26:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764318009] [2023-11-17 11:26:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764318009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528505673] [2023-11-17 11:26:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:11,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2023-11-17 11:26:11,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2023-11-17 11:26:11,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:11,124 INFO L124 PetriNetUnfolderBase]: 60/137 cut-off events. [2023-11-17 11:26:11,125 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-17 11:26:11,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 137 events. 60/137 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 446 event pairs, 23 based on Foata normal form. 20/157 useless extension candidates. Maximal degree in co-relation 329. Up to 58 conditions per place. [2023-11-17 11:26:11,126 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2023-11-17 11:26:11,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 177 flow [2023-11-17 11:26:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2023-11-17 11:26:11,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-11-17 11:26:11,129 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 85 transitions. [2023-11-17 11:26:11,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 85 transitions. [2023-11-17 11:26:11,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:11,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 85 transitions. [2023-11-17 11:26:11,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,131 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 61 flow. Second operand 4 states and 85 transitions. [2023-11-17 11:26:11,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 177 flow [2023-11-17 11:26:11,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:11,133 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 81 flow [2023-11-17 11:26:11,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-11-17 11:26:11,134 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-11-17 11:26:11,134 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 81 flow [2023-11-17 11:26:11,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:11,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:11,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:26:11,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:11,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1571452016, now seen corresponding path program 1 times [2023-11-17 11:26:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501464976] [2023-11-17 11:26:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501464976] [2023-11-17 11:26:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501464976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330738209] [2023-11-17 11:26:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:11,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2023-11-17 11:26:11,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2023-11-17 11:26:11,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:11,335 INFO L124 PetriNetUnfolderBase]: 24/67 cut-off events. [2023-11-17 11:26:11,337 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:26:11,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 67 events. 24/67 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 8 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 195. Up to 29 conditions per place. [2023-11-17 11:26:11,339 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 19 selfloop transitions, 6 changer transitions 1/27 dead transitions. [2023-11-17 11:26:11,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 159 flow [2023-11-17 11:26:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2023-11-17 11:26:11,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.364 [2023-11-17 11:26:11,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 91 transitions. [2023-11-17 11:26:11,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 91 transitions. [2023-11-17 11:26:11,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:11,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 91 transitions. [2023-11-17 11:26:11,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,343 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 81 flow. Second operand 5 states and 91 transitions. [2023-11-17 11:26:11,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 159 flow [2023-11-17 11:26:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 142 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:11,345 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 90 flow [2023-11-17 11:26:11,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-11-17 11:26:11,347 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-11-17 11:26:11,347 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 90 flow [2023-11-17 11:26:11,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:11,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:11,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:26:11,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:11,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1677709114, now seen corresponding path program 1 times [2023-11-17 11:26:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869965301] [2023-11-17 11:26:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869965301] [2023-11-17 11:26:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869965301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706249200] [2023-11-17 11:26:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:11,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2023-11-17 11:26:11,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2023-11-17 11:26:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:11,569 INFO L124 PetriNetUnfolderBase]: 24/71 cut-off events. [2023-11-17 11:26:11,569 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-17 11:26:11,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 71 events. 24/71 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 181 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 225. Up to 41 conditions per place. [2023-11-17 11:26:11,570 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 21 selfloop transitions, 7 changer transitions 10/38 dead transitions. [2023-11-17 11:26:11,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 252 flow [2023-11-17 11:26:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2023-11-17 11:26:11,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.376 [2023-11-17 11:26:11,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 94 transitions. [2023-11-17 11:26:11,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 94 transitions. [2023-11-17 11:26:11,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:11,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 94 transitions. [2023-11-17 11:26:11,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,573 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 90 flow. Second operand 5 states and 94 transitions. [2023-11-17 11:26:11,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 252 flow [2023-11-17 11:26:11,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 190 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-17 11:26:11,577 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-11-17 11:26:11,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-11-17 11:26:11,578 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2023-11-17 11:26:11,579 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-11-17 11:26:11,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:11,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:11,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:26:11,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:11,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1316980368, now seen corresponding path program 2 times [2023-11-17 11:26:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59154975] [2023-11-17 11:26:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59154975] [2023-11-17 11:26:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59154975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:11,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:11,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180612274] [2023-11-17 11:26:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:11,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:11,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2023-11-17 11:26:11,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:11,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2023-11-17 11:26:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:11,756 INFO L124 PetriNetUnfolderBase]: 17/64 cut-off events. [2023-11-17 11:26:11,757 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-17 11:26:11,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 64 events. 17/64 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 164 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 183. Up to 29 conditions per place. [2023-11-17 11:26:11,758 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 18 selfloop transitions, 1 changer transitions 14/33 dead transitions. [2023-11-17 11:26:11,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 193 flow [2023-11-17 11:26:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-11-17 11:26:11,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.405 [2023-11-17 11:26:11,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2023-11-17 11:26:11,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2023-11-17 11:26:11,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:11,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2023-11-17 11:26:11,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,760 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,760 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 4 states and 81 transitions. [2023-11-17 11:26:11,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 193 flow [2023-11-17 11:26:11,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:11,762 INFO L231 Difference]: Finished difference. Result has 33 places, 17 transitions, 67 flow [2023-11-17 11:26:11,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=33, PETRI_TRANSITIONS=17} [2023-11-17 11:26:11,763 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-11-17 11:26:11,763 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 67 flow [2023-11-17 11:26:11,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:11,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:11,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:11,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:26:11,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:11,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 193147830, now seen corresponding path program 3 times [2023-11-17 11:26:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286768699] [2023-11-17 11:26:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286768699] [2023-11-17 11:26:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286768699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664042812] [2023-11-17 11:26:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:12,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2023-11-17 11:26:12,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 17 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:12,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:12,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2023-11-17 11:26:12,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:12,118 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-11-17 11:26:12,119 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-17 11:26:12,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 36 events. 6/36 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 105. Up to 18 conditions per place. [2023-11-17 11:26:12,119 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 14 selfloop transitions, 2 changer transitions 10/27 dead transitions. [2023-11-17 11:26:12,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 158 flow [2023-11-17 11:26:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2023-11-17 11:26:12,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2023-11-17 11:26:12,120 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 113 transitions. [2023-11-17 11:26:12,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 113 transitions. [2023-11-17 11:26:12,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:12,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 113 transitions. [2023-11-17 11:26:12,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:12,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:12,121 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:12,121 INFO L175 Difference]: Start difference. First operand has 33 places, 17 transitions, 67 flow. Second operand 6 states and 113 transitions. [2023-11-17 11:26:12,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 158 flow [2023-11-17 11:26:12,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 140 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-17 11:26:12,122 INFO L231 Difference]: Finished difference. Result has 34 places, 17 transitions, 66 flow [2023-11-17 11:26:12,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=17} [2023-11-17 11:26:12,122 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2023-11-17 11:26:12,123 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 17 transitions, 66 flow [2023-11-17 11:26:12,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:26:12,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:12,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:26:12,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:26:12,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1271992644, now seen corresponding path program 4 times [2023-11-17 11:26:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994011386] [2023-11-17 11:26:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:12,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:26:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:12,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:26:12,205 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:26:12,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:26:12,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:26:12,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:26:12,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:26:12,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:26:12,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:26:12,208 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-17 11:26:12,212 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:26:12,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:26:12,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:26:12,245 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:26:12,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:26:12 BasicIcfg [2023-11-17 11:26:12,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:26:12,259 INFO L158 Benchmark]: Toolchain (without parser) took 4432.11ms. Allocated memory was 274.7MB in the beginning and 331.4MB in the end (delta: 56.6MB). Free memory was 222.5MB in the beginning and 236.9MB in the end (delta: -14.3MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,259 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:26:12,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.29ms. Allocated memory is still 274.7MB. Free memory was 222.3MB in the beginning and 199.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 274.7MB. Free memory was 199.9MB in the beginning and 197.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,260 INFO L158 Benchmark]: Boogie Preprocessor took 42.86ms. Allocated memory is still 274.7MB. Free memory was 197.5MB in the beginning and 195.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,260 INFO L158 Benchmark]: RCFGBuilder took 508.84ms. Allocated memory is still 274.7MB. Free memory was 195.7MB in the beginning and 209.1MB in the end (delta: -13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,260 INFO L158 Benchmark]: TraceAbstraction took 3424.98ms. Allocated memory was 274.7MB in the beginning and 331.4MB in the end (delta: 56.6MB). Free memory was 208.6MB in the beginning and 236.9MB in the end (delta: -28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-11-17 11:26:12,261 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.11ms. Allocated memory is still 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.29ms. Allocated memory is still 274.7MB. Free memory was 222.3MB in the beginning and 199.9MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 274.7MB. Free memory was 199.9MB in the beginning and 197.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.86ms. Allocated memory is still 274.7MB. Free memory was 197.5MB in the beginning and 195.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 508.84ms. Allocated memory is still 274.7MB. Free memory was 195.7MB in the beginning and 209.1MB in the end (delta: -13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3424.98ms. Allocated memory was 274.7MB in the beginning and 331.4MB in the end (delta: 56.6MB). Free memory was 208.6MB in the beginning and 236.9MB in the end (delta: -28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 36 PlacesBefore, 24 PlacesAfterwards, 30 TransitionsBefore, 17 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 18 TotalNumberOfCompositions, 931 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 541, independent: 481, independent conditional: 0, independent unconditional: 481, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 339, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 339, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 541, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 339, unknown conditional: 0, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 51 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: 3.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 3 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 11:26:12,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...