/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:26:51,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:26:51,310 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:51,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:26:51,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:26:51,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:26:51,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:26:51,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:26:51,343 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:26:51,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:26:51,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:26:51,344 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:26:51,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:26:51,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:26:51,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:26:51,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:26:51,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:26:51,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:26:51,346 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:26:51,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:26:51,347 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:26:51,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:26:51,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:26:51,348 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:26:51,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:26:51,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:51,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:26:51,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:26:51,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:26:51,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:26:51,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:26:51,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:26:51,351 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:51,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:26:51,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:26:51,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:26:51,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:26:51,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:26:51,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 11:26:52,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:26:53,108 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:26:53,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 11:26:53,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6701d509d/995fd8dcc5364f719328d5c385b18fc9/FLAGac879f0fe [2023-11-17 11:26:53,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6701d509d/995fd8dcc5364f719328d5c385b18fc9 [2023-11-17 11:26:53,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:26:53,155 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:26:53,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:53,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:26:53,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:26:53,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:53" (1/1) ... [2023-11-17 11:26:53,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caab3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:53, skipping insertion in model container [2023-11-17 11:26:53,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:26:53" (1/1) ... [2023-11-17 11:26:53,221 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:26:53,370 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-17 11:26:53,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:53,600 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:26:53,611 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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2023-11-17 11:26:53,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:26:53,710 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:53,710 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:26:53,717 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:26:53,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:53 WrapperNode [2023-11-17 11:26:53,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:26:53,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:53,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:26:53,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:26:53,727 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:53" (1/1) ... [2023-11-17 11:26:53,743 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:53" (1/1) ... [2023-11-17 11:26:53,770 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-11-17 11:26:53,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:26:53,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:26:53,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:26:53,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:26:53,780 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:53" (1/1) ... [2023-11-17 11:26:53,781 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:53" (1/1) ... [2023-11-17 11:26:53,784 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:53" (1/1) ... [2023-11-17 11:26:53,785 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:53" (1/1) ... [2023-11-17 11:26:53,794 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:53" (1/1) ... [2023-11-17 11:26:53,796 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:53" (1/1) ... [2023-11-17 11:26:53,813 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:53" (1/1) ... [2023-11-17 11:26:53,815 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:53" (1/1) ... [2023-11-17 11:26:53,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:26:53,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:26:53,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:26:53,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:26:53,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:53" (1/1) ... [2023-11-17 11:26:53,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:26:53,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:26:53,902 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:53,915 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:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:26:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:26:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:26:53,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:26:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:26:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:26:53,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:26:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:26:53,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:26:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:26:53,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:26:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:26:53,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:26:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:26:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:26:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:26:53,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:26:53,943 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:54,096 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:26:54,099 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:26:54,382 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:26:54,637 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:26:54,637 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:26:54,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:54 BoogieIcfgContainer [2023-11-17 11:26:54,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:26:54,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:26:54,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:26:54,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:26:54,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:26:53" (1/3) ... [2023-11-17 11:26:54,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381960e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:54, skipping insertion in model container [2023-11-17 11:26:54,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:26:53" (2/3) ... [2023-11-17 11:26:54,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381960e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:26:54, skipping insertion in model container [2023-11-17 11:26:54,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:26:54" (3/3) ... [2023-11-17 11:26:54,648 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-17 11:26:54,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:26:54,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:26:54,666 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:26:54,726 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:26:54,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-17 11:26:54,816 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-17 11:26:54,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:54,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:26:54,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-17 11:26:54,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:54,829 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:26:54,846 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:54,851 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:54,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 104 flow [2023-11-17 11:26:54,871 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-17 11:26:54,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:54,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-17 11:26:54,873 INFO L119 LiptonReduction]: Number of co-enabled transitions 1278 [2023-11-17 11:26:56,769 INFO L134 LiptonReduction]: Checked pairs total: 2769 [2023-11-17 11:26:56,770 INFO L136 LiptonReduction]: Total number of compositions: 23 [2023-11-17 11:26:56,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:26:56,797 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;@6c05ae5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:26:56,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:26:56,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:26:56,803 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-17 11:26:56,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:26:56,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:56,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:56,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:56,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 889825560, now seen corresponding path program 1 times [2023-11-17 11:26:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417366614] [2023-11-17 11:26:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:57,266 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:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417366614] [2023-11-17 11:26:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417366614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:26:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054240436] [2023-11-17 11:26:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:57,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:57,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:57,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 73 [2023-11-17 11:26:57,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:57,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:57,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 73 [2023-11-17 11:26:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:58,070 INFO L124 PetriNetUnfolderBase]: 3567/5160 cut-off events. [2023-11-17 11:26:58,071 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-17 11:26:58,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 5160 events. 3567/5160 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 27060 event pairs, 719 based on Foata normal form. 0/4907 useless extension candidates. Maximal degree in co-relation 10176. Up to 3809 conditions per place. [2023-11-17 11:26:58,110 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 32 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-11-17 11:26:58,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 162 flow [2023-11-17 11:26:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-17 11:26:58,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388127853881278 [2023-11-17 11:26:58,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-17 11:26:58,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-17 11:26:58,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:58,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-17 11:26:58,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:58,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:58,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:58,136 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 118 transitions. [2023-11-17 11:26:58,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 162 flow [2023-11-17 11:26:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:58,142 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-17 11:26:58,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-17 11:26:58,148 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-17 11:26:58,148 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-17 11:26:58,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have 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:58,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:58,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:26:58,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:58,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash 423872242, now seen corresponding path program 1 times [2023-11-17 11:26:58,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:58,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650247656] [2023-11-17 11:26:58,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:58,761 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:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:58,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650247656] [2023-11-17 11:26:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650247656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:58,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:26:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295237195] [2023-11-17 11:26:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:58,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:58,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:26:58,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:58,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:58,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:26:58,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:59,997 INFO L124 PetriNetUnfolderBase]: 9159/12632 cut-off events. [2023-11-17 11:26:59,997 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-11-17 11:27:00,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26082 conditions, 12632 events. 9159/12632 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 65422 event pairs, 607 based on Foata normal form. 384/13016 useless extension candidates. Maximal degree in co-relation 26072. Up to 8177 conditions per place. [2023-11-17 11:27:00,114 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 49 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-11-17 11:27:00,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 270 flow [2023-11-17 11:27:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-17 11:27:00,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-11-17 11:27:00,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-17 11:27:00,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-17 11:27:00,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:00,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-17 11:27:00,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:27:00,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:00,126 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:00,126 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 4 states and 144 transitions. [2023-11-17 11:27:00,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 270 flow [2023-11-17 11:27:00,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:00,130 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 160 flow [2023-11-17 11:27:00,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-11-17 11:27:00,131 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-11-17 11:27:00,131 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 160 flow [2023-11-17 11:27:00,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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:27:00,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:00,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:27:00,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:00,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 255137949, now seen corresponding path program 1 times [2023-11-17 11:27:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276056854] [2023-11-17 11:27:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:00,647 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:27:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276056854] [2023-11-17 11:27:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276056854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:00,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512585176] [2023-11-17 11:27:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:00,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:00,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:27:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:27:00,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:27:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:01,930 INFO L124 PetriNetUnfolderBase]: 9105/12558 cut-off events. [2023-11-17 11:27:01,931 INFO L125 PetriNetUnfolderBase]: For 6682/6682 co-relation queries the response was YES. [2023-11-17 11:27:01,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35597 conditions, 12558 events. 9105/12558 cut-off events. For 6682/6682 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 64822 event pairs, 875 based on Foata normal form. 48/12606 useless extension candidates. Maximal degree in co-relation 35584. Up to 7911 conditions per place. [2023-11-17 11:27:02,050 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 56 selfloop transitions, 23 changer transitions 0/79 dead transitions. [2023-11-17 11:27:02,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 456 flow [2023-11-17 11:27:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-11-17 11:27:02,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068493150684932 [2023-11-17 11:27:02,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 148 transitions. [2023-11-17 11:27:02,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 148 transitions. [2023-11-17 11:27:02,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:02,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 148 transitions. [2023-11-17 11:27:02,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:27:02,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:02,055 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:02,055 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 160 flow. Second operand 4 states and 148 transitions. [2023-11-17 11:27:02,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 456 flow [2023-11-17 11:27:02,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:02,062 INFO L231 Difference]: Finished difference. Result has 47 places, 50 transitions, 326 flow [2023-11-17 11:27:02,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=47, PETRI_TRANSITIONS=50} [2023-11-17 11:27:02,063 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-11-17 11:27:02,063 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 50 transitions, 326 flow [2023-11-17 11:27:02,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:27:02,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:02,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:02,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:27:02,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:02,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -680814605, now seen corresponding path program 1 times [2023-11-17 11:27:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311236447] [2023-11-17 11:27:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:02,465 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:27:02,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311236447] [2023-11-17 11:27:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311236447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545849474] [2023-11-17 11:27:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:02,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:02,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:27:02,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 50 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:27:02,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:02,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:27:02,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:04,119 INFO L124 PetriNetUnfolderBase]: 11477/16026 cut-off events. [2023-11-17 11:27:04,120 INFO L125 PetriNetUnfolderBase]: For 25009/25009 co-relation queries the response was YES. [2023-11-17 11:27:04,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55328 conditions, 16026 events. 11477/16026 cut-off events. For 25009/25009 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 85976 event pairs, 2555 based on Foata normal form. 240/16266 useless extension candidates. Maximal degree in co-relation 55310. Up to 7315 conditions per place. [2023-11-17 11:27:04,251 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 61 selfloop transitions, 29 changer transitions 0/90 dead transitions. [2023-11-17 11:27:04,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 90 transitions, 698 flow [2023-11-17 11:27:04,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-17 11:27:04,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034246575342466 [2023-11-17 11:27:04,253 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-17 11:27:04,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-17 11:27:04,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:04,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-17 11:27:04,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:27:04,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:04,256 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:04,256 INFO L175 Difference]: Start difference. First operand has 47 places, 50 transitions, 326 flow. Second operand 4 states and 147 transitions. [2023-11-17 11:27:04,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 90 transitions, 698 flow [2023-11-17 11:27:04,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 696 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:04,290 INFO L231 Difference]: Finished difference. Result has 53 places, 62 transitions, 572 flow [2023-11-17 11:27:04,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=572, PETRI_PLACES=53, PETRI_TRANSITIONS=62} [2023-11-17 11:27:04,292 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-11-17 11:27:04,292 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 572 flow [2023-11-17 11:27:04,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:27:04,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:04,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:04,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:27:04,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:04,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -680806917, now seen corresponding path program 1 times [2023-11-17 11:27:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180532064] [2023-11-17 11:27:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:04,702 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:27:04,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180532064] [2023-11-17 11:27:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180532064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:04,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337166556] [2023-11-17 11:27:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:04,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:04,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:04,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:04,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:27:04,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:27:04,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:04,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:27:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:06,072 INFO L124 PetriNetUnfolderBase]: 10773/15034 cut-off events. [2023-11-17 11:27:06,072 INFO L125 PetriNetUnfolderBase]: For 46241/46241 co-relation queries the response was YES. [2023-11-17 11:27:06,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59309 conditions, 15034 events. 10773/15034 cut-off events. For 46241/46241 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 78721 event pairs, 2443 based on Foata normal form. 112/15146 useless extension candidates. Maximal degree in co-relation 59286. Up to 7293 conditions per place. [2023-11-17 11:27:06,339 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 70 selfloop transitions, 27 changer transitions 3/100 dead transitions. [2023-11-17 11:27:06,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 1078 flow [2023-11-17 11:27:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2023-11-17 11:27:06,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589041095890411 [2023-11-17 11:27:06,340 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 134 transitions. [2023-11-17 11:27:06,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 134 transitions. [2023-11-17 11:27:06,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:06,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 134 transitions. [2023-11-17 11:27:06,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have 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:27:06,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:06,342 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:06,342 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 572 flow. Second operand 4 states and 134 transitions. [2023-11-17 11:27:06,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 1078 flow [2023-11-17 11:27:06,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 1030 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:06,574 INFO L231 Difference]: Finished difference. Result has 58 places, 76 transitions, 851 flow [2023-11-17 11:27:06,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=851, PETRI_PLACES=58, PETRI_TRANSITIONS=76} [2023-11-17 11:27:06,576 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-11-17 11:27:06,577 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 76 transitions, 851 flow [2023-11-17 11:27:06,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:27:06,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:06,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:06,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:27:06,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:06,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1954497867, now seen corresponding path program 1 times [2023-11-17 11:27:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141979967] [2023-11-17 11:27:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:07,134 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:27:07,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141979967] [2023-11-17 11:27:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141979967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141971615] [2023-11-17 11:27:07,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:07,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:07,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:07,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:07,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2023-11-17 11:27:07,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 76 transitions, 851 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:27:07,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:07,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2023-11-17 11:27:07,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:08,534 INFO L124 PetriNetUnfolderBase]: 8432/12218 cut-off events. [2023-11-17 11:27:08,534 INFO L125 PetriNetUnfolderBase]: For 48966/49293 co-relation queries the response was YES. [2023-11-17 11:27:08,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52489 conditions, 12218 events. 8432/12218 cut-off events. For 48966/49293 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 68500 event pairs, 1824 based on Foata normal form. 266/12312 useless extension candidates. Maximal degree in co-relation 52462. Up to 9173 conditions per place. [2023-11-17 11:27:08,614 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 97 selfloop transitions, 12 changer transitions 6/131 dead transitions. [2023-11-17 11:27:08,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 131 transitions, 1641 flow [2023-11-17 11:27:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2023-11-17 11:27:08,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205479452054794 [2023-11-17 11:27:08,616 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2023-11-17 11:27:08,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2023-11-17 11:27:08,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:08,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2023-11-17 11:27:08,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:27:08,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:08,618 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:08,618 INFO L175 Difference]: Start difference. First operand has 58 places, 76 transitions, 851 flow. Second operand 4 states and 152 transitions. [2023-11-17 11:27:08,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 131 transitions, 1641 flow [2023-11-17 11:27:08,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 1633 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:08,755 INFO L231 Difference]: Finished difference. Result has 62 places, 83 transitions, 964 flow [2023-11-17 11:27:08,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=964, PETRI_PLACES=62, PETRI_TRANSITIONS=83} [2023-11-17 11:27:08,758 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-11-17 11:27:08,758 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 83 transitions, 964 flow [2023-11-17 11:27:08,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have 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:27:08,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:08,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:08,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:27:08,759 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:08,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -462712305, now seen corresponding path program 1 times [2023-11-17 11:27:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351204586] [2023-11-17 11:27:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:09,133 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:27:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:09,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351204586] [2023-11-17 11:27:09,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351204586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:09,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:09,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:09,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386832522] [2023-11-17 11:27:09,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:09,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:09,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:09,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2023-11-17 11:27:09,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 83 transitions, 964 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:27:09,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:09,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2023-11-17 11:27:09,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:10,833 INFO L124 PetriNetUnfolderBase]: 10182/14599 cut-off events. [2023-11-17 11:27:10,833 INFO L125 PetriNetUnfolderBase]: For 68362/69274 co-relation queries the response was YES. [2023-11-17 11:27:10,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66669 conditions, 14599 events. 10182/14599 cut-off events. For 68362/69274 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 84121 event pairs, 4259 based on Foata normal form. 717/15157 useless extension candidates. Maximal degree in co-relation 66639. Up to 11241 conditions per place. [2023-11-17 11:27:11,017 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 88 selfloop transitions, 24 changer transitions 11/139 dead transitions. [2023-11-17 11:27:11,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 139 transitions, 1821 flow [2023-11-17 11:27:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-17 11:27:11,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-11-17 11:27:11,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-17 11:27:11,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-17 11:27:11,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:11,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-17 11:27:11,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have 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:27:11,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:11,021 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:11,021 INFO L175 Difference]: Start difference. First operand has 62 places, 83 transitions, 964 flow. Second operand 5 states and 180 transitions. [2023-11-17 11:27:11,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 139 transitions, 1821 flow [2023-11-17 11:27:11,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 1821 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:27:11,159 INFO L231 Difference]: Finished difference. Result has 68 places, 103 transitions, 1337 flow [2023-11-17 11:27:11,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1337, PETRI_PLACES=68, PETRI_TRANSITIONS=103} [2023-11-17 11:27:11,159 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2023-11-17 11:27:11,159 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 103 transitions, 1337 flow [2023-11-17 11:27:11,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have 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:27:11,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:11,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:11,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:27:11,160 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:11,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -460123185, now seen corresponding path program 2 times [2023-11-17 11:27:11,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:11,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143017501] [2023-11-17 11:27:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:11,603 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:27:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:11,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143017501] [2023-11-17 11:27:11,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143017501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982112219] [2023-11-17 11:27:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:11,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:11,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:11,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:11,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2023-11-17 11:27:11,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 103 transitions, 1337 flow. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have 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:27:11,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:11,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2023-11-17 11:27:11,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:13,181 INFO L124 PetriNetUnfolderBase]: 9959/14372 cut-off events. [2023-11-17 11:27:13,181 INFO L125 PetriNetUnfolderBase]: For 81485/82760 co-relation queries the response was YES. [2023-11-17 11:27:13,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71267 conditions, 14372 events. 9959/14372 cut-off events. For 81485/82760 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 83288 event pairs, 1254 based on Foata normal form. 1133/15346 useless extension candidates. Maximal degree in co-relation 71233. Up to 9551 conditions per place. [2023-11-17 11:27:13,294 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 99 selfloop transitions, 34 changer transitions 3/152 dead transitions. [2023-11-17 11:27:13,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 152 transitions, 2033 flow [2023-11-17 11:27:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:27:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:27:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-17 11:27:13,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885844748858447 [2023-11-17 11:27:13,299 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-17 11:27:13,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-17 11:27:13,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:13,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-17 11:27:13,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have 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:27:13,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:13,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:13,301 INFO L175 Difference]: Start difference. First operand has 68 places, 103 transitions, 1337 flow. Second operand 6 states and 214 transitions. [2023-11-17 11:27:13,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 152 transitions, 2033 flow [2023-11-17 11:27:13,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 152 transitions, 2020 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:13,513 INFO L231 Difference]: Finished difference. Result has 72 places, 106 transitions, 1429 flow [2023-11-17 11:27:13,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1429, PETRI_PLACES=72, PETRI_TRANSITIONS=106} [2023-11-17 11:27:13,514 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-11-17 11:27:13,514 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 106 transitions, 1429 flow [2023-11-17 11:27:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have 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:27:13,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:13,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:27:13,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:13,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -492147735, now seen corresponding path program 3 times [2023-11-17 11:27:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:13,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155811222] [2023-11-17 11:27:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:14,180 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:27:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155811222] [2023-11-17 11:27:14,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155811222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:14,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:27:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174591673] [2023-11-17 11:27:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:27:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:27:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:27:14,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 73 [2023-11-17 11:27:14,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 106 transitions, 1429 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:14,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:14,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 73 [2023-11-17 11:27:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:15,980 INFO L124 PetriNetUnfolderBase]: 12757/17958 cut-off events. [2023-11-17 11:27:15,981 INFO L125 PetriNetUnfolderBase]: For 103641/103641 co-relation queries the response was YES. [2023-11-17 11:27:16,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90164 conditions, 17958 events. 12757/17958 cut-off events. For 103641/103641 co-relation queries the response was YES. Maximal size of possible extension queue 754. Compared 98675 event pairs, 1067 based on Foata normal form. 84/18042 useless extension candidates. Maximal degree in co-relation 90129. Up to 7085 conditions per place. [2023-11-17 11:27:16,130 INFO L140 encePairwiseOnDemand]: 60/73 looper letters, 137 selfloop transitions, 58 changer transitions 10/205 dead transitions. [2023-11-17 11:27:16,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 205 transitions, 2924 flow [2023-11-17 11:27:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:27:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:27:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2023-11-17 11:27:16,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589041095890411 [2023-11-17 11:27:16,132 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 201 transitions. [2023-11-17 11:27:16,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 201 transitions. [2023-11-17 11:27:16,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:16,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 201 transitions. [2023-11-17 11:27:16,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have 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:27:16,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:16,134 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:16,134 INFO L175 Difference]: Start difference. First operand has 72 places, 106 transitions, 1429 flow. Second operand 6 states and 201 transitions. [2023-11-17 11:27:16,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 205 transitions, 2924 flow [2023-11-17 11:27:16,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 205 transitions, 2923 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:16,337 INFO L231 Difference]: Finished difference. Result has 79 places, 134 transitions, 2158 flow [2023-11-17 11:27:16,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2158, PETRI_PLACES=79, PETRI_TRANSITIONS=134} [2023-11-17 11:27:16,338 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-11-17 11:27:16,338 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 134 transitions, 2158 flow [2023-11-17 11:27:16,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:16,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:16,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:16,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:27:16,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:16,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1459180348, now seen corresponding path program 1 times [2023-11-17 11:27:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087714990] [2023-11-17 11:27:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:16,974 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:27:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087714990] [2023-11-17 11:27:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087714990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085896872] [2023-11-17 11:27:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:16,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:16,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2023-11-17 11:27:16,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 134 transitions, 2158 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:27:16,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:16,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2023-11-17 11:27:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:18,612 INFO L124 PetriNetUnfolderBase]: 10026/14562 cut-off events. [2023-11-17 11:27:18,612 INFO L125 PetriNetUnfolderBase]: For 114085/115136 co-relation queries the response was YES. [2023-11-17 11:27:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79688 conditions, 14562 events. 10026/14562 cut-off events. For 114085/115136 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 85821 event pairs, 1876 based on Foata normal form. 461/14680 useless extension candidates. Maximal degree in co-relation 79649. Up to 6196 conditions per place. [2023-11-17 11:27:18,736 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 124 selfloop transitions, 27 changer transitions 7/182 dead transitions. [2023-11-17 11:27:18,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 182 transitions, 2903 flow [2023-11-17 11:27:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2023-11-17 11:27:18,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150684931506849 [2023-11-17 11:27:18,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 188 transitions. [2023-11-17 11:27:18,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 188 transitions. [2023-11-17 11:27:18,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:18,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 188 transitions. [2023-11-17 11:27:18,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have 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:27:18,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:18,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:18,739 INFO L175 Difference]: Start difference. First operand has 79 places, 134 transitions, 2158 flow. Second operand 5 states and 188 transitions. [2023-11-17 11:27:18,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 182 transitions, 2903 flow [2023-11-17 11:27:19,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 182 transitions, 2873 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:19,184 INFO L231 Difference]: Finished difference. Result has 82 places, 132 transitions, 2167 flow [2023-11-17 11:27:19,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2167, PETRI_PLACES=82, PETRI_TRANSITIONS=132} [2023-11-17 11:27:19,185 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2023-11-17 11:27:19,185 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 132 transitions, 2167 flow [2023-11-17 11:27:19,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have 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:27:19,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:19,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:27:19,186 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:19,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1427170120, now seen corresponding path program 1 times [2023-11-17 11:27:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:19,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327090291] [2023-11-17 11:27:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:19,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:19,339 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:27:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327090291] [2023-11-17 11:27:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327090291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127095412] [2023-11-17 11:27:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:19,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:19,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:19,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 132 transitions, 2167 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:27:19,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:19,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:19,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:20,831 INFO L124 PetriNetUnfolderBase]: 8058/12169 cut-off events. [2023-11-17 11:27:20,832 INFO L125 PetriNetUnfolderBase]: For 157492/159717 co-relation queries the response was YES. [2023-11-17 11:27:20,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68598 conditions, 12169 events. 8058/12169 cut-off events. For 157492/159717 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 79707 event pairs, 768 based on Foata normal form. 2511/14415 useless extension candidates. Maximal degree in co-relation 68558. Up to 5335 conditions per place. [2023-11-17 11:27:20,902 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 231 selfloop transitions, 6 changer transitions 8/272 dead transitions. [2023-11-17 11:27:20,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 272 transitions, 4993 flow [2023-11-17 11:27:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-11-17 11:27:20,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-11-17 11:27:20,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 144 transitions. [2023-11-17 11:27:20,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions. [2023-11-17 11:27:20,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:20,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions. [2023-11-17 11:27:20,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have 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:27:20,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:20,905 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:20,905 INFO L175 Difference]: Start difference. First operand has 82 places, 132 transitions, 2167 flow. Second operand 4 states and 144 transitions. [2023-11-17 11:27:20,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 272 transitions, 4993 flow [2023-11-17 11:27:21,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 272 transitions, 4843 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-17 11:27:21,055 INFO L231 Difference]: Finished difference. Result has 83 places, 136 transitions, 2221 flow [2023-11-17 11:27:21,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2221, PETRI_PLACES=83, PETRI_TRANSITIONS=136} [2023-11-17 11:27:21,056 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2023-11-17 11:27:21,056 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 136 transitions, 2221 flow [2023-11-17 11:27:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have 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:27:21,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:21,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:21,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:27:21,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:21,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1930818423, now seen corresponding path program 1 times [2023-11-17 11:27:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261240006] [2023-11-17 11:27:21,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:21,216 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:27:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261240006] [2023-11-17 11:27:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261240006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:21,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:27:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202042337] [2023-11-17 11:27:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:27:21,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:27:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:27:21,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:21,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 136 transitions, 2221 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:27:21,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:21,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:21,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:22,524 INFO L124 PetriNetUnfolderBase]: 6630/10333 cut-off events. [2023-11-17 11:27:22,524 INFO L125 PetriNetUnfolderBase]: For 140935/143848 co-relation queries the response was YES. [2023-11-17 11:27:22,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61872 conditions, 10333 events. 6630/10333 cut-off events. For 140935/143848 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 69623 event pairs, 552 based on Foata normal form. 2428/12527 useless extension candidates. Maximal degree in co-relation 61830. Up to 4210 conditions per place. [2023-11-17 11:27:22,596 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 272 selfloop transitions, 10 changer transitions 12/321 dead transitions. [2023-11-17 11:27:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 321 transitions, 5794 flow [2023-11-17 11:27:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:27:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:27:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2023-11-17 11:27:22,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013698630136987 [2023-11-17 11:27:22,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 183 transitions. [2023-11-17 11:27:22,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 183 transitions. [2023-11-17 11:27:22,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:22,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 183 transitions. [2023-11-17 11:27:22,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:27:22,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:22,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have 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:27:22,603 INFO L175 Difference]: Start difference. First operand has 83 places, 136 transitions, 2221 flow. Second operand 5 states and 183 transitions. [2023-11-17 11:27:22,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 321 transitions, 5794 flow [2023-11-17 11:27:22,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 321 transitions, 5791 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:27:22,721 INFO L231 Difference]: Finished difference. Result has 88 places, 136 transitions, 2253 flow [2023-11-17 11:27:22,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2253, PETRI_PLACES=88, PETRI_TRANSITIONS=136} [2023-11-17 11:27:22,722 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-11-17 11:27:22,722 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 136 transitions, 2253 flow [2023-11-17 11:27:22,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have 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:27:22,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:22,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:27:22,723 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:22,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1017745998, now seen corresponding path program 1 times [2023-11-17 11:27:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444784013] [2023-11-17 11:27:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:23,019 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:27:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444784013] [2023-11-17 11:27:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444784013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:23,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:23,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:27:23,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898622920] [2023-11-17 11:27:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:23,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:27:23,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:23,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:27:23,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:27:23,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 73 [2023-11-17 11:27:23,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 136 transitions, 2253 flow. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:23,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:23,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 73 [2023-11-17 11:27:23,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:24,747 INFO L124 PetriNetUnfolderBase]: 9641/15153 cut-off events. [2023-11-17 11:27:24,747 INFO L125 PetriNetUnfolderBase]: For 182422/183850 co-relation queries the response was YES. [2023-11-17 11:27:24,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101184 conditions, 15153 events. 9641/15153 cut-off events. For 182422/183850 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 107381 event pairs, 1289 based on Foata normal form. 970/15894 useless extension candidates. Maximal degree in co-relation 101139. Up to 8226 conditions per place. [2023-11-17 11:27:24,972 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 121 selfloop transitions, 1 changer transitions 122/258 dead transitions. [2023-11-17 11:27:24,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 258 transitions, 4553 flow [2023-11-17 11:27:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:27:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:27:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-17 11:27:24,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342465753424658 [2023-11-17 11:27:24,977 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-17 11:27:24,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-17 11:27:24,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:24,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-17 11:27:24,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:24,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:24,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have 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:27:24,981 INFO L175 Difference]: Start difference. First operand has 88 places, 136 transitions, 2253 flow. Second operand 4 states and 156 transitions. [2023-11-17 11:27:24,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 258 transitions, 4553 flow [2023-11-17 11:27:25,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 258 transitions, 4515 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:25,276 INFO L231 Difference]: Finished difference. Result has 91 places, 103 transitions, 1591 flow [2023-11-17 11:27:25,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1591, PETRI_PLACES=91, PETRI_TRANSITIONS=103} [2023-11-17 11:27:25,277 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-11-17 11:27:25,277 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 103 transitions, 1591 flow [2023-11-17 11:27:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:27:25,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:25,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:27:25,278 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:25,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1425413938, now seen corresponding path program 2 times [2023-11-17 11:27:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315595343] [2023-11-17 11:27:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:25,451 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:27:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:25,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315595343] [2023-11-17 11:27:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315595343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:25,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:27:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458610482] [2023-11-17 11:27:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:27:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:27:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:27:25,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 73 [2023-11-17 11:27:25,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 103 transitions, 1591 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:25,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:25,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 73 [2023-11-17 11:27:25,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:26,636 INFO L124 PetriNetUnfolderBase]: 6160/10086 cut-off events. [2023-11-17 11:27:26,637 INFO L125 PetriNetUnfolderBase]: For 106445/106878 co-relation queries the response was YES. [2023-11-17 11:27:26,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62874 conditions, 10086 events. 6160/10086 cut-off events. For 106445/106878 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 69642 event pairs, 1861 based on Foata normal form. 393/10433 useless extension candidates. Maximal degree in co-relation 62828. Up to 5093 conditions per place. [2023-11-17 11:27:26,711 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 100 selfloop transitions, 11 changer transitions 36/152 dead transitions. [2023-11-17 11:27:26,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 152 transitions, 2487 flow [2023-11-17 11:27:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:27:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:27:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-17 11:27:26,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342465753424658 [2023-11-17 11:27:26,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-17 11:27:26,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-17 11:27:26,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:26,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-17 11:27:26,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have 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:27:26,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:27:26,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have 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:27:26,714 INFO L175 Difference]: Start difference. First operand has 91 places, 103 transitions, 1591 flow. Second operand 3 states and 117 transitions. [2023-11-17 11:27:26,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 152 transitions, 2487 flow [2023-11-17 11:27:26,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 152 transitions, 2470 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 11:27:26,951 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 1452 flow [2023-11-17 11:27:26,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2023-11-17 11:27:26,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-11-17 11:27:26,952 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 1452 flow [2023-11-17 11:27:26,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:26,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:26,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:26,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:27:26,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:26,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1671883089, now seen corresponding path program 1 times [2023-11-17 11:27:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270481667] [2023-11-17 11:27:26,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:27,092 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:27:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:27,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270481667] [2023-11-17 11:27:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270481667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:27,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:27,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:27:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304100876] [2023-11-17 11:27:27,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:27,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:27:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:27:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:27:27,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:27,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 1452 flow. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have 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:27:27,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:27,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:27,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:28,186 INFO L124 PetriNetUnfolderBase]: 4713/7712 cut-off events. [2023-11-17 11:27:28,187 INFO L125 PetriNetUnfolderBase]: For 89579/90628 co-relation queries the response was YES. [2023-11-17 11:27:28,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45702 conditions, 7712 events. 4713/7712 cut-off events. For 89579/90628 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 53684 event pairs, 461 based on Foata normal form. 1127/8717 useless extension candidates. Maximal degree in co-relation 45656. Up to 2574 conditions per place. [2023-11-17 11:27:28,225 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 161 selfloop transitions, 14 changer transitions 42/228 dead transitions. [2023-11-17 11:27:28,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 228 transitions, 3833 flow [2023-11-17 11:27:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:27:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:27:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2023-11-17 11:27:28,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977168949771689 [2023-11-17 11:27:28,226 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 218 transitions. [2023-11-17 11:27:28,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 218 transitions. [2023-11-17 11:27:28,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:28,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 218 transitions. [2023-11-17 11:27:28,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:27:28,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:28,228 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:27:28,228 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 1452 flow. Second operand 6 states and 218 transitions. [2023-11-17 11:27:28,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 228 transitions, 3833 flow [2023-11-17 11:27:28,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 228 transitions, 3682 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:28,276 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 1298 flow [2023-11-17 11:27:28,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1298, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2023-11-17 11:27:28,276 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2023-11-17 11:27:28,276 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 1298 flow [2023-11-17 11:27:28,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have 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:27:28,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:28,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:28,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:27:28,277 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:28,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash 863413184, now seen corresponding path program 1 times [2023-11-17 11:27:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:28,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268233049] [2023-11-17 11:27:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:28,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:27:28,449 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:27:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:27:28,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268233049] [2023-11-17 11:27:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268233049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:27:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:27:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:27:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455181150] [2023-11-17 11:27:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:27:28,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:27:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:27:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:27:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:27:28,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 73 [2023-11-17 11:27:28,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 1298 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:27:28,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:27:28,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 73 [2023-11-17 11:27:28,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:27:29,437 INFO L124 PetriNetUnfolderBase]: 4177/6900 cut-off events. [2023-11-17 11:27:29,438 INFO L125 PetriNetUnfolderBase]: For 70458/71287 co-relation queries the response was YES. [2023-11-17 11:27:29,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42687 conditions, 6900 events. 4177/6900 cut-off events. For 70458/71287 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 48015 event pairs, 451 based on Foata normal form. 649/7446 useless extension candidates. Maximal degree in co-relation 42642. Up to 2420 conditions per place. [2023-11-17 11:27:29,475 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 63 selfloop transitions, 18 changer transitions 108/194 dead transitions. [2023-11-17 11:27:29,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 194 transitions, 3139 flow [2023-11-17 11:27:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:27:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:27:29,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2023-11-17 11:27:29,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481409001956947 [2023-11-17 11:27:29,476 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 229 transitions. [2023-11-17 11:27:29,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 229 transitions. [2023-11-17 11:27:29,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:27:29,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 229 transitions. [2023-11-17 11:27:29,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:27:29,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 73.0) internal successors, (584), 8 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have 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:27:29,478 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 73.0) internal successors, (584), 8 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have 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:27:29,478 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 1298 flow. Second operand 7 states and 229 transitions. [2023-11-17 11:27:29,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 194 transitions, 3139 flow [2023-11-17 11:27:29,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 194 transitions, 3034 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-17 11:27:29,676 INFO L231 Difference]: Finished difference. Result has 96 places, 51 transitions, 584 flow [2023-11-17 11:27:29,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=96, PETRI_TRANSITIONS=51} [2023-11-17 11:27:29,676 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2023-11-17 11:27:29,677 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 51 transitions, 584 flow [2023-11-17 11:27:29,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have 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:27:29,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:27:29,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:29,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:27:29,677 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:27:29,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:27:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1103713303, now seen corresponding path program 1 times [2023-11-17 11:27:29,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:27:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462812218] [2023-11-17 11:27:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:27:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:27:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:29,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:27:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:27:29,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:27:29,809 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:27:29,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:27:29,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:27:29,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:27:29,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:27:29,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:27:29,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:27:29,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:27:29,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:27:29,821 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:27:29,826 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:27:29,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:27:29,892 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:27:29,894 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:27:29,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:27:29,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:27:29,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:27:29 BasicIcfg [2023-11-17 11:27:29,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:27:29,914 INFO L158 Benchmark]: Toolchain (without parser) took 36759.72ms. Allocated memory was 189.8MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 137.6MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-11-17 11:27:29,915 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:27:29,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.43ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 113.9MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:29,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.83ms. Allocated memory is still 189.8MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:29,915 INFO L158 Benchmark]: Boogie Preprocessor took 47.18ms. Allocated memory is still 189.8MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:27:29,916 INFO L158 Benchmark]: RCFGBuilder took 819.48ms. Allocated memory was 189.8MB in the beginning and 317.7MB in the end (delta: 127.9MB). Free memory was 109.1MB in the beginning and 243.3MB in the end (delta: -134.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2023-11-17 11:27:29,916 INFO L158 Benchmark]: TraceAbstraction took 35272.03ms. Allocated memory was 317.7MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 242.8MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-11-17 11:27:29,917 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.20ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.43ms. Allocated memory is still 189.8MB. Free memory was 137.3MB in the beginning and 113.9MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.83ms. Allocated memory is still 189.8MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.18ms. Allocated memory is still 189.8MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 819.48ms. Allocated memory was 189.8MB in the beginning and 317.7MB in the end (delta: 127.9MB). Free memory was 109.1MB in the beginning and 243.3MB in the end (delta: -134.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * TraceAbstraction took 35272.03ms. Allocated memory was 317.7MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 242.8MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 58 PlacesBefore, 41 PlacesAfterwards, 46 TransitionsBefore, 28 TransitionsAfterwards, 1278 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 23 TotalNumberOfCompositions, 2769 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1288, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 834, independent: 789, independent conditional: 0, independent unconditional: 789, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 834, independent: 780, independent conditional: 0, independent unconditional: 780, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 268, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1288, independent: 402, independent conditional: 0, independent unconditional: 402, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 834, unknown conditional: 0, unknown unconditional: 834] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1396 IncrementalHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 32 mSDtfsCounter, 1396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2253occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:27:29,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...