/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/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:28:59,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:29:00,132 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:29:00,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:29:00,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:29:00,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:29:00,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:29:00,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:29:00,168 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:29:00,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:29:00,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:29:00,172 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:29:00,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:29:00,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:29:00,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:29:00,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:29:00,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:29:00,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:29:00,174 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:29:00,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:29:00,174 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:29:00,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:29:00,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:29:00,175 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:29:00,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:29:00,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:00,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:29:00,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:29:00,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:29:00,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:29:00,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:29:00,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:29:00,178 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:29:00,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:29:00,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:29:00,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:29:00,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:29:00,453 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:29:00,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-11-17 11:29:01,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:29:02,040 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:29:02,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-11-17 11:29:02,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85538431/2ad138637d6d49618e8b30498d1c3dbb/FLAG88169399b [2023-11-17 11:29:02,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85538431/2ad138637d6d49618e8b30498d1c3dbb [2023-11-17 11:29:02,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:29:02,090 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:29:02,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:02,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:29:02,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:29:02,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27efc6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02, skipping insertion in model container [2023-11-17 11:29:02,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,152 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:29:02,287 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/safe016_rmo.oepc.i[993,1006] [2023-11-17 11:29:02,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:02,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:29:02,540 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/safe016_rmo.oepc.i[993,1006] [2023-11-17 11:29:02,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:29:02,667 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:02,668 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:29:02,674 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:29:02,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02 WrapperNode [2023-11-17 11:29:02,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:29:02,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:02,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:29:02,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:29:02,682 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:29:02" (1/1) ... [2023-11-17 11:29:02,717 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:29:02" (1/1) ... [2023-11-17 11:29:02,762 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 187 [2023-11-17 11:29:02,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:29:02,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:29:02,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:29:02,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:29:02,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:29:02,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:29:02,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:29:02,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:29:02,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (1/1) ... [2023-11-17 11:29:02,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:29:02,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:29:02,853 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:29:02,857 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:29:02,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:29:02,876 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:29:02,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:29:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:29:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:29:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:29:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:29:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:29:02,877 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:29:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:29:02,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:29:02,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:29:02,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:29:02,879 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:29:03,014 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:29:03,015 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:29:03,445 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:29:03,788 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:29:03,788 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:29:03,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:03 BoogieIcfgContainer [2023-11-17 11:29:03,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:29:03,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:29:03,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:29:03,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:29:03,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:29:02" (1/3) ... [2023-11-17 11:29:03,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7152a21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:03, skipping insertion in model container [2023-11-17 11:29:03,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:29:02" (2/3) ... [2023-11-17 11:29:03,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7152a21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:29:03, skipping insertion in model container [2023-11-17 11:29:03,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:29:03" (3/3) ... [2023-11-17 11:29:03,798 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2023-11-17 11:29:03,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:29:03,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:29:03,817 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:29:03,881 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:29:03,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:03,964 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-11-17 11:29:03,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:03,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-11-17 11:29:03,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 45 transitions, 106 flow [2023-11-17 11:29:03,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:03,978 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:29:04,004 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:04,009 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:04,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 88 flow [2023-11-17 11:29:04,033 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2023-11-17 11:29:04,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:04,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2023-11-17 11:29:04,035 INFO L119 LiptonReduction]: Number of co-enabled transitions 850 [2023-11-17 11:29:08,994 INFO L134 LiptonReduction]: Checked pairs total: 1485 [2023-11-17 11:29:08,995 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-11-17 11:29:09,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:29:09,023 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;@7024e5c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:29:09,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:29:09,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:29:09,031 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-17 11:29:09,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:29:09,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:09,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:09,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:09,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1360130627, now seen corresponding path program 1 times [2023-11-17 11:29:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:09,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864725812] [2023-11-17 11:29:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:09,540 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:29:09,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:09,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864725812] [2023-11-17 11:29:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864725812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:09,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:09,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277883296] [2023-11-17 11:29:09,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:09,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:09,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:09,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2023-11-17 11:29:09,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:29:09,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:09,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2023-11-17 11:29:09,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:10,326 INFO L124 PetriNetUnfolderBase]: 2773/3846 cut-off events. [2023-11-17 11:29:10,326 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-11-17 11:29:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 3846 events. 2773/3846 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17036 event pairs, 561 based on Foata normal form. 40/3886 useless extension candidates. Maximal degree in co-relation 7840. Up to 3461 conditions per place. [2023-11-17 11:29:10,356 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-11-17 11:29:10,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 185 flow [2023-11-17 11:29:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-17 11:29:10,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-17 11:29:10,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-17 11:29:10,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-17 11:29:10,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:10,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-17 11:29:10,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:10,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:10,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:10,382 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 96 transitions. [2023-11-17 11:29:10,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 185 flow [2023-11-17 11:29:10,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:10,389 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-11-17 11:29:10,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-17 11:29:10,397 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-17 11:29:10,397 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-11-17 11:29:10,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:29:10,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:10,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:10,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:29:10,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:10,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -785623175, now seen corresponding path program 1 times [2023-11-17 11:29:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:10,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095510373] [2023-11-17 11:29:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:10,783 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:29:10,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:10,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095510373] [2023-11-17 11:29:10,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095510373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119668172] [2023-11-17 11:29:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:10,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2023-11-17 11:29:10,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:29:10,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:10,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2023-11-17 11:29:10,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:11,374 INFO L124 PetriNetUnfolderBase]: 2354/3315 cut-off events. [2023-11-17 11:29:11,374 INFO L125 PetriNetUnfolderBase]: For 465/466 co-relation queries the response was YES. [2023-11-17 11:29:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 3315 events. 2354/3315 cut-off events. For 465/466 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14776 event pairs, 404 based on Foata normal form. 40/3354 useless extension candidates. Maximal degree in co-relation 7390. Up to 2813 conditions per place. [2023-11-17 11:29:11,399 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 33 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-17 11:29:11,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 174 flow [2023-11-17 11:29:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2023-11-17 11:29:11,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2023-11-17 11:29:11,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 94 transitions. [2023-11-17 11:29:11,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 94 transitions. [2023-11-17 11:29:11,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:11,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 94 transitions. [2023-11-17 11:29:11,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:29:11,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:11,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:11,409 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 94 transitions. [2023-11-17 11:29:11,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 174 flow [2023-11-17 11:29:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:11,417 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 78 flow [2023-11-17 11:29:11,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-11-17 11:29:11,418 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-11-17 11:29:11,418 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 78 flow [2023-11-17 11:29:11,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:29:11,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:11,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:29:11,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:11,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1112895764, now seen corresponding path program 1 times [2023-11-17 11:29:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888374177] [2023-11-17 11:29:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:11,787 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:29:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888374177] [2023-11-17 11:29:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888374177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:29:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552449226] [2023-11-17 11:29:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:11,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:11,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2023-11-17 11:29:11,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:29:11,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:11,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2023-11-17 11:29:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:12,304 INFO L124 PetriNetUnfolderBase]: 2400/3401 cut-off events. [2023-11-17 11:29:12,305 INFO L125 PetriNetUnfolderBase]: For 831/831 co-relation queries the response was YES. [2023-11-17 11:29:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 3401 events. 2400/3401 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15245 event pairs, 644 based on Foata normal form. 32/3433 useless extension candidates. Maximal degree in co-relation 7820. Up to 2545 conditions per place. [2023-11-17 11:29:12,331 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-17 11:29:12,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 203 flow [2023-11-17 11:29:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2023-11-17 11:29:12,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2023-11-17 11:29:12,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 103 transitions. [2023-11-17 11:29:12,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 103 transitions. [2023-11-17 11:29:12,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:12,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 103 transitions. [2023-11-17 11:29:12,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:29:12,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:12,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:12,335 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 78 flow. Second operand 3 states and 103 transitions. [2023-11-17 11:29:12,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 203 flow [2023-11-17 11:29:12,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:12,338 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 82 flow [2023-11-17 11:29:12,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-11-17 11:29:12,339 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-17 11:29:12,339 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 82 flow [2023-11-17 11:29:12,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states 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:29:12,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:12,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:29:12,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:12,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1420741174, now seen corresponding path program 1 times [2023-11-17 11:29:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990002137] [2023-11-17 11:29:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990002137] [2023-11-17 11:29:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990002137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925052601] [2023-11-17 11:29:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:12,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:29:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:29:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:29:12,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2023-11-17 11:29:12,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:29:12,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:12,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2023-11-17 11:29:12,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:12,997 INFO L124 PetriNetUnfolderBase]: 3167/4488 cut-off events. [2023-11-17 11:29:12,997 INFO L125 PetriNetUnfolderBase]: For 1545/1545 co-relation queries the response was YES. [2023-11-17 11:29:13,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10672 conditions, 4488 events. 3167/4488 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20673 event pairs, 1797 based on Foata normal form. 96/4584 useless extension candidates. Maximal degree in co-relation 10658. Up to 2795 conditions per place. [2023-11-17 11:29:13,030 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-11-17 11:29:13,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2023-11-17 11:29:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2023-11-17 11:29:13,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-11-17 11:29:13,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 96 transitions. [2023-11-17 11:29:13,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 96 transitions. [2023-11-17 11:29:13,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:13,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 96 transitions. [2023-11-17 11:29:13,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:13,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:13,037 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 82 flow. Second operand 3 states and 96 transitions. [2023-11-17 11:29:13,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2023-11-17 11:29:13,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:13,041 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 89 flow [2023-11-17 11:29:13,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-11-17 11:29:13,043 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-17 11:29:13,043 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 89 flow [2023-11-17 11:29:13,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:29:13,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:13,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:13,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:29:13,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:13,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash 251830252, now seen corresponding path program 1 times [2023-11-17 11:29:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280925161] [2023-11-17 11:29:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:14,365 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:29:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280925161] [2023-11-17 11:29:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280925161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242328642] [2023-11-17 11:29:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:14,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:14,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:14,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:14,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2023-11-17 11:29:14,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:29:14,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:14,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2023-11-17 11:29:14,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:14,944 INFO L124 PetriNetUnfolderBase]: 2548/3645 cut-off events. [2023-11-17 11:29:14,945 INFO L125 PetriNetUnfolderBase]: For 1641/1690 co-relation queries the response was YES. [2023-11-17 11:29:14,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 3645 events. 2548/3645 cut-off events. For 1641/1690 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16816 event pairs, 634 based on Foata normal form. 22/3663 useless extension candidates. Maximal degree in co-relation 8818. Up to 3201 conditions per place. [2023-11-17 11:29:14,973 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-11-17 11:29:14,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 194 flow [2023-11-17 11:29:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:29:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:29:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2023-11-17 11:29:14,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-11-17 11:29:14,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 97 transitions. [2023-11-17 11:29:14,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 97 transitions. [2023-11-17 11:29:14,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:14,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 97 transitions. [2023-11-17 11:29:14,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:29:14,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:14,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:14,977 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 89 flow. Second operand 3 states and 97 transitions. [2023-11-17 11:29:14,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 194 flow [2023-11-17 11:29:14,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:14,980 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 103 flow [2023-11-17 11:29:14,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-11-17 11:29:14,981 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-11-17 11:29:14,981 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 103 flow [2023-11-17 11:29:14,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states 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:29:14,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:14,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:14,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:29:14,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:14,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -783197021, now seen corresponding path program 1 times [2023-11-17 11:29:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:14,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786988130] [2023-11-17 11:29:14,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:15,253 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:29:15,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:15,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786988130] [2023-11-17 11:29:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786988130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:15,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:29:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775977968] [2023-11-17 11:29:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:15,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:15,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2023-11-17 11:29:15,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:29:15,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:15,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2023-11-17 11:29:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:15,839 INFO L124 PetriNetUnfolderBase]: 3065/4368 cut-off events. [2023-11-17 11:29:15,839 INFO L125 PetriNetUnfolderBase]: For 2205/2263 co-relation queries the response was YES. [2023-11-17 11:29:15,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10812 conditions, 4368 events. 3065/4368 cut-off events. For 2205/2263 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20956 event pairs, 2186 based on Foata normal form. 43/4407 useless extension candidates. Maximal degree in co-relation 10796. Up to 3793 conditions per place. [2023-11-17 11:29:15,867 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2023-11-17 11:29:15,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 214 flow [2023-11-17 11:29:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2023-11-17 11:29:15,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2023-11-17 11:29:15,869 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 119 transitions. [2023-11-17 11:29:15,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 119 transitions. [2023-11-17 11:29:15,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:15,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 119 transitions. [2023-11-17 11:29:15,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:29:15,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:15,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:15,871 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 103 flow. Second operand 4 states and 119 transitions. [2023-11-17 11:29:15,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 214 flow [2023-11-17 11:29:15,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:29:15,875 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 155 flow [2023-11-17 11:29:15,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-11-17 11:29:15,879 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-11-17 11:29:15,879 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 155 flow [2023-11-17 11:29:15,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:29:15,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:15,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:29:15,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:15,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash -783217481, now seen corresponding path program 2 times [2023-11-17 11:29:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303397048] [2023-11-17 11:29:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:16,321 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:29:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:16,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303397048] [2023-11-17 11:29:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303397048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:16,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:16,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892177870] [2023-11-17 11:29:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:16,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2023-11-17 11:29:16,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:29:16,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2023-11-17 11:29:16,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:17,152 INFO L124 PetriNetUnfolderBase]: 4289/6219 cut-off events. [2023-11-17 11:29:17,153 INFO L125 PetriNetUnfolderBase]: For 5336/5396 co-relation queries the response was YES. [2023-11-17 11:29:17,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17750 conditions, 6219 events. 4289/6219 cut-off events. For 5336/5396 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33512 event pairs, 1736 based on Foata normal form. 92/6308 useless extension candidates. Maximal degree in co-relation 17732. Up to 3484 conditions per place. [2023-11-17 11:29:17,191 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2023-11-17 11:29:17,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 328 flow [2023-11-17 11:29:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2023-11-17 11:29:17,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2023-11-17 11:29:17,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 153 transitions. [2023-11-17 11:29:17,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 153 transitions. [2023-11-17 11:29:17,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:17,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 153 transitions. [2023-11-17 11:29:17,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:29:17,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:29:17,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:29:17,196 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 155 flow. Second operand 5 states and 153 transitions. [2023-11-17 11:29:17,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 328 flow [2023-11-17 11:29:17,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:17,204 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 191 flow [2023-11-17 11:29:17,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-11-17 11:29:17,208 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-11-17 11:29:17,210 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 191 flow [2023-11-17 11:29:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:29:17,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:17,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:29:17,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:17,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1230326499, now seen corresponding path program 1 times [2023-11-17 11:29:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679575804] [2023-11-17 11:29:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:29:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:17,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679575804] [2023-11-17 11:29:17,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679575804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:17,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:17,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:29:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063499183] [2023-11-17 11:29:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:17,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:29:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:17,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:29:17,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:29:17,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2023-11-17 11:29:17,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:29:17,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:17,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2023-11-17 11:29:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:18,300 INFO L124 PetriNetUnfolderBase]: 4236/6304 cut-off events. [2023-11-17 11:29:18,301 INFO L125 PetriNetUnfolderBase]: For 6961/6991 co-relation queries the response was YES. [2023-11-17 11:29:18,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18689 conditions, 6304 events. 4236/6304 cut-off events. For 6961/6991 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 36240 event pairs, 489 based on Foata normal form. 469/6771 useless extension candidates. Maximal degree in co-relation 18670. Up to 2900 conditions per place. [2023-11-17 11:29:18,325 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 69 selfloop transitions, 6 changer transitions 5/82 dead transitions. [2023-11-17 11:29:18,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 585 flow [2023-11-17 11:29:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:29:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:29:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2023-11-17 11:29:18,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2023-11-17 11:29:18,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 117 transitions. [2023-11-17 11:29:18,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 117 transitions. [2023-11-17 11:29:18,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:18,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 117 transitions. [2023-11-17 11:29:18,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.25) internal successors, (117), 4 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:29:18,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:18,328 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:18,328 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 191 flow. Second operand 4 states and 117 transitions. [2023-11-17 11:29:18,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 585 flow [2023-11-17 11:29:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 545 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:29:18,335 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 221 flow [2023-11-17 11:29:18,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-11-17 11:29:18,335 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-11-17 11:29:18,336 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 221 flow [2023-11-17 11:29:18,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:29:18,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:18,336 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:29:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:29:18,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:18,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1496465449, now seen corresponding path program 1 times [2023-11-17 11:29:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018415572] [2023-11-17 11:29:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:18,517 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:29:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018415572] [2023-11-17 11:29:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018415572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:29:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259408799] [2023-11-17 11:29:18,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:18,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:29:18,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:18,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:29:18,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:29:18,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2023-11-17 11:29:18,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:18,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:18,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2023-11-17 11:29:18,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:19,080 INFO L124 PetriNetUnfolderBase]: 2658/4136 cut-off events. [2023-11-17 11:29:19,080 INFO L125 PetriNetUnfolderBase]: For 5777/5800 co-relation queries the response was YES. [2023-11-17 11:29:19,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14815 conditions, 4136 events. 2658/4136 cut-off events. For 5777/5800 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23424 event pairs, 201 based on Foata normal form. 374/4508 useless extension candidates. Maximal degree in co-relation 14793. Up to 1673 conditions per place. [2023-11-17 11:29:19,096 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 86 selfloop transitions, 10 changer transitions 9/107 dead transitions. [2023-11-17 11:29:19,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 765 flow [2023-11-17 11:29:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:29:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:29:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2023-11-17 11:29:19,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-11-17 11:29:19,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 148 transitions. [2023-11-17 11:29:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 148 transitions. [2023-11-17 11:29:19,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:19,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 148 transitions. [2023-11-17 11:29:19,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 29.6) internal successors, (148), 5 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:29:19,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:29:19,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:29:19,099 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 221 flow. Second operand 5 states and 148 transitions. [2023-11-17 11:29:19,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 765 flow [2023-11-17 11:29:19,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 107 transitions, 752 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:29:19,108 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 275 flow [2023-11-17 11:29:19,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-17 11:29:19,109 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-11-17 11:29:19,109 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 275 flow [2023-11-17 11:29:19,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:29:19,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:19,111 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:29:19,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:29:19,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:19,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1191020441, now seen corresponding path program 1 times [2023-11-17 11:29:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816969682] [2023-11-17 11:29:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:19,306 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:29:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816969682] [2023-11-17 11:29:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816969682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:29:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404411584] [2023-11-17 11:29:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:29:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:29:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:29:19,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2023-11-17 11:29:19,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:19,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:19,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2023-11-17 11:29:19,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:19,712 INFO L124 PetriNetUnfolderBase]: 1618/2585 cut-off events. [2023-11-17 11:29:19,712 INFO L125 PetriNetUnfolderBase]: For 5293/5321 co-relation queries the response was YES. [2023-11-17 11:29:19,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10524 conditions, 2585 events. 1618/2585 cut-off events. For 5293/5321 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13760 event pairs, 190 based on Foata normal form. 196/2779 useless extension candidates. Maximal degree in co-relation 10500. Up to 999 conditions per place. [2023-11-17 11:29:19,726 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 89 selfloop transitions, 14 changer transitions 11/116 dead transitions. [2023-11-17 11:29:19,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 116 transitions, 881 flow [2023-11-17 11:29:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:29:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:29:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2023-11-17 11:29:19,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2023-11-17 11:29:19,728 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 177 transitions. [2023-11-17 11:29:19,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 177 transitions. [2023-11-17 11:29:19,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:19,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 177 transitions. [2023-11-17 11:29:19,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:29:19,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:29:19,730 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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:29:19,730 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 275 flow. Second operand 6 states and 177 transitions. [2023-11-17 11:29:19,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 116 transitions, 881 flow [2023-11-17 11:29:19,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 116 transitions, 849 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-17 11:29:19,760 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 307 flow [2023-11-17 11:29:19,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-17 11:29:19,761 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2023-11-17 11:29:19,761 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 307 flow [2023-11-17 11:29:19,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:29:19,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:19,761 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:29:19,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:29:19,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:19,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1462229283, now seen corresponding path program 1 times [2023-11-17 11:29:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345907154] [2023-11-17 11:29:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:29:19,975 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:29:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:29:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345907154] [2023-11-17 11:29:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345907154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:29:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:29:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:29:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124279625] [2023-11-17 11:29:19,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:29:19,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:29:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:29:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:29:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:29:19,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2023-11-17 11:29:19,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:29:19,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:29:19,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2023-11-17 11:29:19,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:29:20,321 INFO L124 PetriNetUnfolderBase]: 1285/2028 cut-off events. [2023-11-17 11:29:20,322 INFO L125 PetriNetUnfolderBase]: For 4208/4239 co-relation queries the response was YES. [2023-11-17 11:29:20,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8557 conditions, 2028 events. 1285/2028 cut-off events. For 4208/4239 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10336 event pairs, 189 based on Foata normal form. 68/2094 useless extension candidates. Maximal degree in co-relation 8532. Up to 784 conditions per place. [2023-11-17 11:29:20,329 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 63 selfloop transitions, 18 changer transitions 17/99 dead transitions. [2023-11-17 11:29:20,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 771 flow [2023-11-17 11:29:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:29:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:29:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2023-11-17 11:29:20,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2023-11-17 11:29:20,331 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 182 transitions. [2023-11-17 11:29:20,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 182 transitions. [2023-11-17 11:29:20,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:29:20,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 182 transitions. [2023-11-17 11:29:20,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:29:20,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 60.0) internal successors, (480), 8 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:29:20,332 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 60.0) internal successors, (480), 8 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:29:20,333 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 307 flow. Second operand 7 states and 182 transitions. [2023-11-17 11:29:20,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 771 flow [2023-11-17 11:29:20,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 702 flow, removed 14 selfloop flow, removed 7 redundant places. [2023-11-17 11:29:20,363 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 282 flow [2023-11-17 11:29:20,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-11-17 11:29:20,363 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-11-17 11:29:20,363 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 282 flow [2023-11-17 11:29:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:29:20,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:29:20,364 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:29:20,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:29:20,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 11:29:20,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:29:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -932622871, now seen corresponding path program 1 times [2023-11-17 11:29:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:29:20,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726571733] [2023-11-17 11:29:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:29:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:29:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:20,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:29:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:29:20,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:29:20,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:29:20,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 11:29:20,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 11:29:20,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 11:29:20,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 11:29:20,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 11:29:20,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:29:20,585 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:29:20,590 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:29:20,590 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:29:20,661 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated [2023-11-17 11:29:20,671 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated [2023-11-17 11:29:20,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated [2023-11-17 11:29:20,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre23 could not be translated [2023-11-17 11:29:20,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:29:20 BasicIcfg [2023-11-17 11:29:20,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:29:20,695 INFO L158 Benchmark]: Toolchain (without parser) took 18605.19ms. Allocated memory was 347.1MB in the beginning and 771.8MB in the end (delta: 424.7MB). Free memory was 293.3MB in the beginning and 420.0MB in the end (delta: -126.7MB). Peak memory consumption was 299.0MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,695 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 216.0MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:29:20,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.70ms. Allocated memory is still 347.1MB. Free memory was 293.3MB in the beginning and 268.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.83ms. Allocated memory is still 347.1MB. Free memory was 268.4MB in the beginning and 265.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,696 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 347.1MB. Free memory was 265.4MB in the beginning and 263.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,696 INFO L158 Benchmark]: RCFGBuilder took 972.79ms. Allocated memory is still 347.1MB. Free memory was 262.9MB in the beginning and 231.8MB in the end (delta: 31.1MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,696 INFO L158 Benchmark]: TraceAbstraction took 16902.47ms. Allocated memory was 347.1MB in the beginning and 771.8MB in the end (delta: 424.7MB). Free memory was 231.3MB in the beginning and 420.0MB in the end (delta: -188.8MB). Peak memory consumption was 235.9MB. Max. memory is 8.0GB. [2023-11-17 11:29:20,698 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.13ms. Allocated memory is still 216.0MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 582.70ms. Allocated memory is still 347.1MB. Free memory was 293.3MB in the beginning and 268.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.83ms. Allocated memory is still 347.1MB. Free memory was 268.4MB in the beginning and 265.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 347.1MB. Free memory was 265.4MB in the beginning and 263.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 972.79ms. Allocated memory is still 347.1MB. Free memory was 262.9MB in the beginning and 231.8MB in the end (delta: 31.1MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16902.47ms. Allocated memory was 347.1MB in the beginning and 771.8MB in the end (delta: 424.7MB). Free memory was 231.3MB in the beginning and 420.0MB in the end (delta: -188.8MB). Peak memory consumption was 235.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre23 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: 5.0s, 51 PlacesBefore, 36 PlacesAfterwards, 38 TransitionsBefore, 23 TransitionsAfterwards, 850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 750, independent: 687, independent conditional: 0, independent unconditional: 687, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 540, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 540, independent: 487, independent conditional: 0, independent unconditional: 487, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 522, dependent conditional: 0, dependent unconditional: 522, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 750, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 540, unknown conditional: 0, unknown unconditional: 540] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 pthread_t t2162; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t2163; [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t2164; [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L826] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161={7:0}, t2162={8:0}, t2163={9:0}, t2164={5:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 858]: 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: 854]: 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: 856]: 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: 852]: 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, 75 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 420 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 2 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=10, InterpolantAutomatonStates: 46, 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.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:29:20,738 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...