/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:57:15,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:57:15,779 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-VariableLbe.epf [2023-08-23 22:57:15,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:57:15,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:57:15,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:57:15,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:57:15,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:57:15,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:57:15,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:57:15,816 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:57:15,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:57:15,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:57:15,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:57:15,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:57:15,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:57:15,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:57:15,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:57:15,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:57:15,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:57:15,819 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:57:15,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:57:15,820 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:57:15,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:57:15,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:57:15,821 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:57:15,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:57:15,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:57:15,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:57:15,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:57:15,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:57:15,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:57:15,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:57:15,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:57:15,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:57:15,824 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 22:57:16,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:57:16,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:57:16,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:57:16,110 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:57:16,110 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:57:16,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-23 22:57:17,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:57:17,487 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:57:17,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-08-23 22:57:17,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c0217e9/4bc6e590efc54dbbba1a1213ed119865/FLAG43c8d9d41 [2023-08-23 22:57:17,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5c0217e9/4bc6e590efc54dbbba1a1213ed119865 [2023-08-23 22:57:17,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:57:17,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:57:17,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:57:17,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:57:17,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:57:17,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:57:17" (1/1) ... [2023-08-23 22:57:17,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a785d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:17, skipping insertion in model container [2023-08-23 22:57:17,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:57:17" (1/1) ... [2023-08-23 22:57:17,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:57:17,704 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/mix005_tso.oepc.i[949,962] [2023-08-23 22:57:17,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:57:17,943 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:57:17,953 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/mix005_tso.oepc.i[949,962] [2023-08-23 22:57:17,969 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:57:17,970 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:57:18,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:57:18,042 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:57:18,042 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:57:18,049 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:57:18,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18 WrapperNode [2023-08-23 22:57:18,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:57:18,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:57:18,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:57:18,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:57:18,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,128 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-23 22:57:18,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:57:18,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:57:18,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:57:18,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:57:18,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:57:18,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:57:18,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:57:18,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:57:18,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (1/1) ... [2023-08-23 22:57:18,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:57:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:57:18,214 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-08-23 22:57:18,237 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-08-23 22:57:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:57:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 22:57:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:57:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:57:18,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:57:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 22:57:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 22:57:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 22:57:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 22:57:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 22:57:18,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 22:57:18,256 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 22:57:18,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 22:57:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:57:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 22:57:18,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:57:18,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:57:18,259 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:57:18,390 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:57:18,392 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:57:18,652 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:57:18,803 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:57:18,803 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 22:57:18,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:57:18 BoogieIcfgContainer [2023-08-23 22:57:18,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:57:18,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:57:18,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:57:18,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:57:18,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:57:17" (1/3) ... [2023-08-23 22:57:18,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431a7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:57:18, skipping insertion in model container [2023-08-23 22:57:18,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:57:18" (2/3) ... [2023-08-23 22:57:18,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1431a7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:57:18, skipping insertion in model container [2023-08-23 22:57:18,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:57:18" (3/3) ... [2023-08-23 22:57:18,816 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-08-23 22:57:18,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:57:18,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:57:18,832 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:57:18,892 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 22:57:18,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-23 22:57:19,005 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-23 22:57:19,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:57:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-23 22:57:19,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-23 22:57:19,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-23 22:57:19,020 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:57:19,027 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-23 22:57:19,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-23 22:57:19,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-23 22:57:19,061 INFO L124 PetriNetUnfolderBase]: 2/129 cut-off events. [2023-08-23 22:57:19,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:57:19,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-23 22:57:19,066 INFO L119 LiptonReduction]: Number of co-enabled transitions 3272 [2023-08-23 22:57:23,109 INFO L134 LiptonReduction]: Checked pairs total: 9891 [2023-08-23 22:57:23,110 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-23 22:57:23,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:57:23,127 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=LoopsAndPotentialCycles, 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;@7d1fec9d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:57:23,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 22:57:23,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:57:23,131 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-23 22:57:23,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:57:23,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:23,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-23 22:57:23,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:23,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 530157842, now seen corresponding path program 1 times [2023-08-23 22:57:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567826329] [2023-08-23 22:57:23,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:23,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:23,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567826329] [2023-08-23 22:57:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567826329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:57:23,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145280366] [2023-08-23 22:57:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:23,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:57:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:57:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:57:23,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 239 [2023-08-23 22:57:23,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:23,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:23,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 239 [2023-08-23 22:57:23,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:24,417 INFO L124 PetriNetUnfolderBase]: 4695/6585 cut-off events. [2023-08-23 22:57:24,418 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-08-23 22:57:24,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13161 conditions, 6585 events. 4695/6585 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34013 event pairs, 1757 based on Foata normal form. 0/6268 useless extension candidates. Maximal degree in co-relation 13149. Up to 5107 conditions per place. [2023-08-23 22:57:24,456 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-23 22:57:24,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 202 flow [2023-08-23 22:57:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:57:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:57:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-23 22:57:24,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536959553695955 [2023-08-23 22:57:24,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-23 22:57:24,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-23 22:57:24,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:24,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-23 22:57:24,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:24,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:24,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:24,488 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 397 transitions. [2023-08-23 22:57:24,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 202 flow [2023-08-23 22:57:24,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:24,495 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-08-23 22:57:24,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-23 22:57:24,500 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-08-23 22:57:24,501 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-08-23 22:57:24,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:24,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:24,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:24,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:57:24,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:24,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2089934941, now seen corresponding path program 1 times [2023-08-23 22:57:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223944728] [2023-08-23 22:57:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223944728] [2023-08-23 22:57:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223944728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:57:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620391619] [2023-08-23 22:57:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:24,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:57:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:57:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:57:24,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-08-23 22:57:24,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:24,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:24,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-08-23 22:57:24,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:25,625 INFO L124 PetriNetUnfolderBase]: 4855/6999 cut-off events. [2023-08-23 22:57:25,625 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2023-08-23 22:57:25,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14317 conditions, 6999 events. 4855/6999 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 38825 event pairs, 1527 based on Foata normal form. 320/7265 useless extension candidates. Maximal degree in co-relation 14307. Up to 3761 conditions per place. [2023-08-23 22:57:25,655 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 34 selfloop transitions, 2 changer transitions 23/64 dead transitions. [2023-08-23 22:57:25,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 264 flow [2023-08-23 22:57:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-23 22:57:25,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5196652719665272 [2023-08-23 22:57:25,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-23 22:57:25,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-23 22:57:25,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:25,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-23 22:57:25,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:25,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:25,664 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:25,664 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 621 transitions. [2023-08-23 22:57:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 264 flow [2023-08-23 22:57:25,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:57:25,667 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 80 flow [2023-08-23 22:57:25,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-08-23 22:57:25,669 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-23 22:57:25,671 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 80 flow [2023-08-23 22:57:25,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:25,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:25,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:25,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:57:25,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:25,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1681534632, now seen corresponding path program 1 times [2023-08-23 22:57:25,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:25,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211099994] [2023-08-23 22:57:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211099994] [2023-08-23 22:57:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211099994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:57:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752058672] [2023-08-23 22:57:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:26,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:26,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-08-23 22:57:26,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:26,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:26,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-08-23 22:57:26,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:27,711 INFO L124 PetriNetUnfolderBase]: 12729/17190 cut-off events. [2023-08-23 22:57:27,711 INFO L125 PetriNetUnfolderBase]: For 2700/2700 co-relation queries the response was YES. [2023-08-23 22:57:27,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37049 conditions, 17190 events. 12729/17190 cut-off events. For 2700/2700 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 83306 event pairs, 3239 based on Foata normal form. 600/17790 useless extension candidates. Maximal degree in co-relation 37036. Up to 11381 conditions per place. [2023-08-23 22:57:27,781 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 45 selfloop transitions, 2 changer transitions 28/75 dead transitions. [2023-08-23 22:57:27,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 327 flow [2023-08-23 22:57:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-23 22:57:27,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4661087866108787 [2023-08-23 22:57:27,783 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-23 22:57:27,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-23 22:57:27,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:27,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-23 22:57:27,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:27,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:27,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:27,788 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 80 flow. Second operand 5 states and 557 transitions. [2023-08-23 22:57:27,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 327 flow [2023-08-23 22:57:27,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 317 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:27,879 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 84 flow [2023-08-23 22:57:27,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-23 22:57:27,880 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-23 22:57:27,880 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 84 flow [2023-08-23 22:57:27,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:27,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:27,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:57:27,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:27,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1338019359, now seen corresponding path program 1 times [2023-08-23 22:57:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:27,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571470682] [2023-08-23 22:57:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:28,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:28,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571470682] [2023-08-23 22:57:28,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571470682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:28,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:28,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:57:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680908870] [2023-08-23 22:57:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:28,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:28,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:57:28,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:28,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:28,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:57:28,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:28,921 INFO L124 PetriNetUnfolderBase]: 4322/6155 cut-off events. [2023-08-23 22:57:28,921 INFO L125 PetriNetUnfolderBase]: For 1313/1320 co-relation queries the response was YES. [2023-08-23 22:57:28,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13076 conditions, 6155 events. 4322/6155 cut-off events. For 1313/1320 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31623 event pairs, 2213 based on Foata normal form. 182/6292 useless extension candidates. Maximal degree in co-relation 13062. Up to 5155 conditions per place. [2023-08-23 22:57:28,944 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 39 selfloop transitions, 3 changer transitions 19/66 dead transitions. [2023-08-23 22:57:28,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 288 flow [2023-08-23 22:57:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-23 22:57:28,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087866108786611 [2023-08-23 22:57:28,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-23 22:57:28,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-23 22:57:28,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:28,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-23 22:57:28,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:28,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:28,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:28,951 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 84 flow. Second operand 5 states and 608 transitions. [2023-08-23 22:57:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 288 flow [2023-08-23 22:57:28,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 280 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:28,961 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 103 flow [2023-08-23 22:57:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-23 22:57:28,962 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-23 22:57:28,962 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 103 flow [2023-08-23 22:57:28,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:28,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:28,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:28,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:57:28,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:28,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1490388582, now seen corresponding path program 1 times [2023-08-23 22:57:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350768724] [2023-08-23 22:57:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350768724] [2023-08-23 22:57:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350768724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271037349] [2023-08-23 22:57:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:29,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:57:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:57:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:57:29,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:57:29,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:29,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:29,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:57:29,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:30,074 INFO L124 PetriNetUnfolderBase]: 4482/6526 cut-off events. [2023-08-23 22:57:30,074 INFO L125 PetriNetUnfolderBase]: For 2749/2765 co-relation queries the response was YES. [2023-08-23 22:57:30,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15239 conditions, 6526 events. 4482/6526 cut-off events. For 2749/2765 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 36567 event pairs, 918 based on Foata normal form. 161/6635 useless extension candidates. Maximal degree in co-relation 15224. Up to 5089 conditions per place. [2023-08-23 22:57:30,104 INFO L140 encePairwiseOnDemand]: 231/239 looper letters, 50 selfloop transitions, 7 changer transitions 18/80 dead transitions. [2023-08-23 22:57:30,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 377 flow [2023-08-23 22:57:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:57:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:57:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-23 22:57:30,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097629009762901 [2023-08-23 22:57:30,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-23 22:57:30,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-23 22:57:30,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:30,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-23 22:57:30,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:30,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:30,111 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:30,111 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 103 flow. Second operand 6 states and 731 transitions. [2023-08-23 22:57:30,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 377 flow [2023-08-23 22:57:30,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:57:30,120 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 151 flow [2023-08-23 22:57:30,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-23 22:57:30,121 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-08-23 22:57:30,121 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 151 flow [2023-08-23 22:57:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:30,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:30,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:30,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:57:30,122 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:30,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1161112422, now seen corresponding path program 1 times [2023-08-23 22:57:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795902637] [2023-08-23 22:57:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:30,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795902637] [2023-08-23 22:57:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795902637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:30,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:57:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298035642] [2023-08-23 22:57:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:30,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:30,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:30,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:30,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:30,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:30,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:30,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:31,175 INFO L124 PetriNetUnfolderBase]: 4513/6661 cut-off events. [2023-08-23 22:57:31,175 INFO L125 PetriNetUnfolderBase]: For 7896/8093 co-relation queries the response was YES. [2023-08-23 22:57:31,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18985 conditions, 6661 events. 4513/6661 cut-off events. For 7896/8093 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 37892 event pairs, 655 based on Foata normal form. 154/6745 useless extension candidates. Maximal degree in co-relation 18967. Up to 4787 conditions per place. [2023-08-23 22:57:31,217 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 55 selfloop transitions, 9 changer transitions 16/85 dead transitions. [2023-08-23 22:57:31,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 485 flow [2023-08-23 22:57:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:57:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:57:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-08-23 22:57:31,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139470013947002 [2023-08-23 22:57:31,220 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-08-23 22:57:31,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-08-23 22:57:31,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:31,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-08-23 22:57:31,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:31,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:31,224 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:31,225 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 151 flow. Second operand 6 states and 737 transitions. [2023-08-23 22:57:31,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 485 flow [2023-08-23 22:57:31,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 468 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-23 22:57:31,254 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 196 flow [2023-08-23 22:57:31,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-23 22:57:31,256 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-23 22:57:31,257 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 196 flow [2023-08-23 22:57:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:31,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:31,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:57:31,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:31,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1554937702, now seen corresponding path program 2 times [2023-08-23 22:57:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599426117] [2023-08-23 22:57:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:31,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:31,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599426117] [2023-08-23 22:57:31,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599426117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:31,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:31,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395705902] [2023-08-23 22:57:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:31,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:57:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:57:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:57:31,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:31,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:31,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:31,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:31,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:32,160 INFO L124 PetriNetUnfolderBase]: 4369/6427 cut-off events. [2023-08-23 22:57:32,161 INFO L125 PetriNetUnfolderBase]: For 11343/11800 co-relation queries the response was YES. [2023-08-23 22:57:32,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20206 conditions, 6427 events. 4369/6427 cut-off events. For 11343/11800 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 35902 event pairs, 645 based on Foata normal form. 178/6535 useless extension candidates. Maximal degree in co-relation 20186. Up to 4733 conditions per place. [2023-08-23 22:57:32,195 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 53 selfloop transitions, 9 changer transitions 16/83 dead transitions. [2023-08-23 22:57:32,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 510 flow [2023-08-23 22:57:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:57:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:57:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-23 22:57:32,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125523012552301 [2023-08-23 22:57:32,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-23 22:57:32,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-23 22:57:32,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:32,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-23 22:57:32,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:32,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:32,202 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:32,202 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 196 flow. Second operand 6 states and 735 transitions. [2023-08-23 22:57:32,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 510 flow [2023-08-23 22:57:32,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 485 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-23 22:57:32,220 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 206 flow [2023-08-23 22:57:32,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-23 22:57:32,220 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2023-08-23 22:57:32,221 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 206 flow [2023-08-23 22:57:32,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:32,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:32,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:57:32,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:32,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash -557057471, now seen corresponding path program 1 times [2023-08-23 22:57:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:32,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259943733] [2023-08-23 22:57:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259943733] [2023-08-23 22:57:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259943733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:32,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:32,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334991101] [2023-08-23 22:57:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:32,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:57:32,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:57:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:57:32,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:57:32,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:32,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:32,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:57:32,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:33,089 INFO L124 PetriNetUnfolderBase]: 4475/6537 cut-off events. [2023-08-23 22:57:33,089 INFO L125 PetriNetUnfolderBase]: For 12487/13059 co-relation queries the response was YES. [2023-08-23 22:57:33,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20811 conditions, 6537 events. 4475/6537 cut-off events. For 12487/13059 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 36303 event pairs, 745 based on Foata normal form. 173/6640 useless extension candidates. Maximal degree in co-relation 20789. Up to 4833 conditions per place. [2023-08-23 22:57:33,119 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 62 selfloop transitions, 14 changer transitions 9/90 dead transitions. [2023-08-23 22:57:33,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 554 flow [2023-08-23 22:57:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:57:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:57:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-23 22:57:33,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125523012552301 [2023-08-23 22:57:33,122 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-23 22:57:33,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-23 22:57:33,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:33,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-23 22:57:33,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:33,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:33,126 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:33,126 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 206 flow. Second operand 6 states and 735 transitions. [2023-08-23 22:57:33,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 554 flow [2023-08-23 22:57:33,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 528 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-23 22:57:33,153 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 258 flow [2023-08-23 22:57:33,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-23 22:57:33,154 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2023-08-23 22:57:33,154 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 258 flow [2023-08-23 22:57:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:33,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:33,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:33,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 22:57:33,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:33,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1080235481, now seen corresponding path program 2 times [2023-08-23 22:57:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764893567] [2023-08-23 22:57:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764893567] [2023-08-23 22:57:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764893567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:33,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:57:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748630875] [2023-08-23 22:57:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:33,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:57:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:57:33,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:57:33,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 239 [2023-08-23 22:57:33,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:33,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:33,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 239 [2023-08-23 22:57:33,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:34,152 INFO L124 PetriNetUnfolderBase]: 4533/6623 cut-off events. [2023-08-23 22:57:34,152 INFO L125 PetriNetUnfolderBase]: For 15369/16157 co-relation queries the response was YES. [2023-08-23 22:57:34,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22844 conditions, 6623 events. 4533/6623 cut-off events. For 15369/16157 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36810 event pairs, 725 based on Foata normal form. 214/6767 useless extension candidates. Maximal degree in co-relation 22823. Up to 4857 conditions per place. [2023-08-23 22:57:34,179 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 63 selfloop transitions, 17 changer transitions 15/100 dead transitions. [2023-08-23 22:57:34,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 686 flow [2023-08-23 22:57:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:57:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:57:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-08-23 22:57:34,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5044829647340108 [2023-08-23 22:57:34,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-08-23 22:57:34,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-08-23 22:57:34,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:34,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-08-23 22:57:34,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:34,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:34,189 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:34,189 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 258 flow. Second operand 7 states and 844 transitions. [2023-08-23 22:57:34,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 686 flow [2023-08-23 22:57:34,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 642 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:34,203 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 313 flow [2023-08-23 22:57:34,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-23 22:57:34,204 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2023-08-23 22:57:34,204 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 313 flow [2023-08-23 22:57:34,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:34,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:34,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:34,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 22:57:34,205 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:34,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 630906707, now seen corresponding path program 3 times [2023-08-23 22:57:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718343438] [2023-08-23 22:57:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718343438] [2023-08-23 22:57:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718343438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:34,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:57:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189996429] [2023-08-23 22:57:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:34,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:57:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:34,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:57:34,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:57:34,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 239 [2023-08-23 22:57:34,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:34,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:34,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 239 [2023-08-23 22:57:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:35,363 INFO L124 PetriNetUnfolderBase]: 4583/6701 cut-off events. [2023-08-23 22:57:35,363 INFO L125 PetriNetUnfolderBase]: For 26569/27491 co-relation queries the response was YES. [2023-08-23 22:57:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26255 conditions, 6701 events. 4583/6701 cut-off events. For 26569/27491 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37356 event pairs, 739 based on Foata normal form. 234/6865 useless extension candidates. Maximal degree in co-relation 26232. Up to 4925 conditions per place. [2023-08-23 22:57:35,396 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 67 selfloop transitions, 21 changer transitions 9/102 dead transitions. [2023-08-23 22:57:35,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 799 flow [2023-08-23 22:57:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:57:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:57:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-23 22:57:35,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-23 22:57:35,403 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-23 22:57:35,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-23 22:57:35,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:35,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-23 22:57:35,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:35,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:35,407 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:35,407 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 313 flow. Second operand 6 states and 717 transitions. [2023-08-23 22:57:35,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 799 flow [2023-08-23 22:57:35,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 752 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:35,427 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 442 flow [2023-08-23 22:57:35,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2023-08-23 22:57:35,428 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2023-08-23 22:57:35,428 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 442 flow [2023-08-23 22:57:35,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:35,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:35,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:35,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 22:57:35,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:35,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1421857111, now seen corresponding path program 4 times [2023-08-23 22:57:35,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:35,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707192045] [2023-08-23 22:57:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:35,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:35,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707192045] [2023-08-23 22:57:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707192045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:35,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:57:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684713316] [2023-08-23 22:57:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:35,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:57:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:57:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:57:35,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 239 [2023-08-23 22:57:35,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:35,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:35,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 239 [2023-08-23 22:57:35,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:37,932 INFO L124 PetriNetUnfolderBase]: 16195/21876 cut-off events. [2023-08-23 22:57:37,933 INFO L125 PetriNetUnfolderBase]: For 102805/102805 co-relation queries the response was YES. [2023-08-23 22:57:37,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88665 conditions, 21876 events. 16195/21876 cut-off events. For 102805/102805 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 111193 event pairs, 2618 based on Foata normal form. 312/22188 useless extension candidates. Maximal degree in co-relation 88640. Up to 13616 conditions per place. [2023-08-23 22:57:38,032 INFO L140 encePairwiseOnDemand]: 227/239 looper letters, 109 selfloop transitions, 32 changer transitions 23/164 dead transitions. [2023-08-23 22:57:38,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 164 transitions, 1319 flow [2023-08-23 22:57:38,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 22:57:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 22:57:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1100 transitions. [2023-08-23 22:57:38,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602510460251046 [2023-08-23 22:57:38,036 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1100 transitions. [2023-08-23 22:57:38,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1100 transitions. [2023-08-23 22:57:38,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:38,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1100 transitions. [2023-08-23 22:57:38,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:38,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:38,042 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:38,042 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 442 flow. Second operand 10 states and 1100 transitions. [2023-08-23 22:57:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 164 transitions, 1319 flow [2023-08-23 22:57:38,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 164 transitions, 1248 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-08-23 22:57:38,231 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 604 flow [2023-08-23 22:57:38,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=604, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-08-23 22:57:38,231 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2023-08-23 22:57:38,232 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 604 flow [2023-08-23 22:57:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:38,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:38,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:38,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 22:57:38,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:38,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1823243975, now seen corresponding path program 1 times [2023-08-23 22:57:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310175398] [2023-08-23 22:57:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:38,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-08-23 22:57:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310175398] [2023-08-23 22:57:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310175398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939075401] [2023-08-23 22:57:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-23 22:57:38,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:38,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-23 22:57:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:39,900 INFO L124 PetriNetUnfolderBase]: 12758/18410 cut-off events. [2023-08-23 22:57:39,900 INFO L125 PetriNetUnfolderBase]: For 179192/182605 co-relation queries the response was YES. [2023-08-23 22:57:39,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93517 conditions, 18410 events. 12758/18410 cut-off events. For 179192/182605 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 113951 event pairs, 2086 based on Foata normal form. 746/18892 useless extension candidates. Maximal degree in co-relation 93487. Up to 8590 conditions per place. [2023-08-23 22:57:40,026 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 119 selfloop transitions, 3 changer transitions 27/159 dead transitions. [2023-08-23 22:57:40,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 159 transitions, 1782 flow [2023-08-23 22:57:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-23 22:57:40,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121338912133891 [2023-08-23 22:57:40,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-23 22:57:40,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-23 22:57:40,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:40,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-23 22:57:40,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:40,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:40,251 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:40,251 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 604 flow. Second operand 5 states and 612 transitions. [2023-08-23 22:57:40,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 159 transitions, 1782 flow [2023-08-23 22:57:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 159 transitions, 1620 flow, removed 77 selfloop flow, removed 4 redundant places. [2023-08-23 22:57:40,406 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 580 flow [2023-08-23 22:57:40,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=580, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2023-08-23 22:57:40,408 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-08-23 22:57:40,408 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 580 flow [2023-08-23 22:57:40,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:40,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:40,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:40,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 22:57:40,409 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:40,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash 240424201, now seen corresponding path program 2 times [2023-08-23 22:57:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232851412] [2023-08-23 22:57:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232851412] [2023-08-23 22:57:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232851412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:40,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:40,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:57:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693117566] [2023-08-23 22:57:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:40,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:57:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:57:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:57:40,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:40,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 580 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:40,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:40,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:40,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:42,112 INFO L124 PetriNetUnfolderBase]: 8687/12776 cut-off events. [2023-08-23 22:57:42,112 INFO L125 PetriNetUnfolderBase]: For 100673/102712 co-relation queries the response was YES. [2023-08-23 22:57:42,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60403 conditions, 12776 events. 8687/12776 cut-off events. For 100673/102712 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 81224 event pairs, 1327 based on Foata normal form. 1522/13911 useless extension candidates. Maximal degree in co-relation 60373. Up to 7935 conditions per place. [2023-08-23 22:57:42,201 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 133 selfloop transitions, 10 changer transitions 4/164 dead transitions. [2023-08-23 22:57:42,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 164 transitions, 1665 flow [2023-08-23 22:57:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-23 22:57:42,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2023-08-23 22:57:42,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-23 22:57:42,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-23 22:57:42,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:42,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-23 22:57:42,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:42,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:42,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:42,209 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 580 flow. Second operand 5 states and 619 transitions. [2023-08-23 22:57:42,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 164 transitions, 1665 flow [2023-08-23 22:57:42,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 164 transitions, 1659 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:57:42,282 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 660 flow [2023-08-23 22:57:42,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=660, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2023-08-23 22:57:42,283 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-08-23 22:57:42,283 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 660 flow [2023-08-23 22:57:42,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:42,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:42,284 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-08-23 22:57:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 22:57:42,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:42,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -978086122, now seen corresponding path program 1 times [2023-08-23 22:57:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:42,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520144977] [2023-08-23 22:57:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:42,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520144977] [2023-08-23 22:57:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520144977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045700545] [2023-08-23 22:57:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:42,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:42,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:42,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:42,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:42,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 660 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:42,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:42,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:42,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:43,450 INFO L124 PetriNetUnfolderBase]: 6948/10512 cut-off events. [2023-08-23 22:57:43,450 INFO L125 PetriNetUnfolderBase]: For 90878/92568 co-relation queries the response was YES. [2023-08-23 22:57:43,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55299 conditions, 10512 events. 6948/10512 cut-off events. For 90878/92568 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 68201 event pairs, 622 based on Foata normal form. 1186/11377 useless extension candidates. Maximal degree in co-relation 55266. Up to 3875 conditions per place. [2023-08-23 22:57:43,519 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 155 selfloop transitions, 19 changer transitions 16/207 dead transitions. [2023-08-23 22:57:43,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 207 transitions, 2228 flow [2023-08-23 22:57:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:57:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:57:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-08-23 22:57:43,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188284518828452 [2023-08-23 22:57:43,522 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-08-23 22:57:43,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-08-23 22:57:43,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:43,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-08-23 22:57:43,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:43,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:43,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:43,527 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 660 flow. Second operand 7 states and 868 transitions. [2023-08-23 22:57:43,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 207 transitions, 2228 flow [2023-08-23 22:57:43,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 207 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:57:43,637 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 716 flow [2023-08-23 22:57:43,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=716, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2023-08-23 22:57:43,638 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2023-08-23 22:57:43,638 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 716 flow [2023-08-23 22:57:43,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:43,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:43,638 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-08-23 22:57:43,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-23 22:57:43,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:43,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1328774113, now seen corresponding path program 1 times [2023-08-23 22:57:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595735993] [2023-08-23 22:57:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595735993] [2023-08-23 22:57:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595735993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:43,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:57:43,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087335153] [2023-08-23 22:57:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:43,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:57:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:57:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:57:43,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 239 [2023-08-23 22:57:43,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:43,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:43,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 239 [2023-08-23 22:57:43,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:46,573 INFO L124 PetriNetUnfolderBase]: 21285/30649 cut-off events. [2023-08-23 22:57:46,574 INFO L125 PetriNetUnfolderBase]: For 228080/228080 co-relation queries the response was YES. [2023-08-23 22:57:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165857 conditions, 30649 events. 21285/30649 cut-off events. For 228080/228080 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 190792 event pairs, 1791 based on Foata normal form. 108/30757 useless extension candidates. Maximal degree in co-relation 165820. Up to 16355 conditions per place. [2023-08-23 22:57:46,729 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 128 selfloop transitions, 16 changer transitions 83/227 dead transitions. [2023-08-23 22:57:46,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 227 transitions, 2526 flow [2023-08-23 22:57:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:57:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:57:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-08-23 22:57:46,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45188284518828453 [2023-08-23 22:57:46,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-08-23 22:57:46,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-08-23 22:57:46,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:46,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-08-23 22:57:46,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:46,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:46,737 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:46,737 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 716 flow. Second operand 7 states and 756 transitions. [2023-08-23 22:57:46,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 227 transitions, 2526 flow [2023-08-23 22:57:48,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 227 transitions, 2387 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-23 22:57:48,218 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 757 flow [2023-08-23 22:57:48,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=757, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2023-08-23 22:57:48,219 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2023-08-23 22:57:48,219 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 757 flow [2023-08-23 22:57:48,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:48,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:48,219 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-08-23 22:57:48,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-23 22:57:48,219 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:48,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1877195163, now seen corresponding path program 2 times [2023-08-23 22:57:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940212117] [2023-08-23 22:57:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940212117] [2023-08-23 22:57:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940212117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:57:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806684478] [2023-08-23 22:57:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:48,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:57:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:57:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:57:48,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:48,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 757 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:48,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:48,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:49,352 INFO L124 PetriNetUnfolderBase]: 4196/6744 cut-off events. [2023-08-23 22:57:49,353 INFO L125 PetriNetUnfolderBase]: For 63289/64659 co-relation queries the response was YES. [2023-08-23 22:57:49,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36724 conditions, 6744 events. 4196/6744 cut-off events. For 63289/64659 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 43632 event pairs, 527 based on Foata normal form. 617/7110 useless extension candidates. Maximal degree in co-relation 36682. Up to 2397 conditions per place. [2023-08-23 22:57:49,390 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 115 selfloop transitions, 17 changer transitions 28/181 dead transitions. [2023-08-23 22:57:49,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 181 transitions, 2059 flow [2023-08-23 22:57:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:57:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:57:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-08-23 22:57:49,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194261805140467 [2023-08-23 22:57:49,393 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-08-23 22:57:49,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-08-23 22:57:49,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:49,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-08-23 22:57:49,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:49,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:49,397 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:49,398 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 757 flow. Second operand 7 states and 869 transitions. [2023-08-23 22:57:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 181 transitions, 2059 flow [2023-08-23 22:57:49,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 181 transitions, 1764 flow, removed 81 selfloop flow, removed 11 redundant places. [2023-08-23 22:57:49,482 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 722 flow [2023-08-23 22:57:49,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=722, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2023-08-23 22:57:49,482 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2023-08-23 22:57:49,482 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 722 flow [2023-08-23 22:57:49,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:49,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:49,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-23 22:57:49,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:49,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1987160477, now seen corresponding path program 1 times [2023-08-23 22:57:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342535989] [2023-08-23 22:57:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342535989] [2023-08-23 22:57:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342535989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:49,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:49,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 22:57:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006947204] [2023-08-23 22:57:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:49,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:57:49,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:57:49,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:57:49,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:49,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:49,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:49,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:49,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:50,456 INFO L124 PetriNetUnfolderBase]: 4052/6509 cut-off events. [2023-08-23 22:57:50,456 INFO L125 PetriNetUnfolderBase]: For 42401/43571 co-relation queries the response was YES. [2023-08-23 22:57:50,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34305 conditions, 6509 events. 4052/6509 cut-off events. For 42401/43571 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 42448 event pairs, 504 based on Foata normal form. 322/6581 useless extension candidates. Maximal degree in co-relation 34266. Up to 2280 conditions per place. [2023-08-23 22:57:50,482 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 78 selfloop transitions, 17 changer transitions 74/181 dead transitions. [2023-08-23 22:57:50,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 181 transitions, 1840 flow [2023-08-23 22:57:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 22:57:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 22:57:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1089 transitions. [2023-08-23 22:57:50,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-08-23 22:57:50,485 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1089 transitions. [2023-08-23 22:57:50,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1089 transitions. [2023-08-23 22:57:50,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:50,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1089 transitions. [2023-08-23 22:57:50,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.0) internal successors, (1089), 9 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:50,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:50,491 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:50,491 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 722 flow. Second operand 9 states and 1089 transitions. [2023-08-23 22:57:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 181 transitions, 1840 flow [2023-08-23 22:57:50,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 181 transitions, 1628 flow, removed 81 selfloop flow, removed 5 redundant places. [2023-08-23 22:57:50,688 INFO L231 Difference]: Finished difference. Result has 94 places, 65 transitions, 502 flow [2023-08-23 22:57:50,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=94, PETRI_TRANSITIONS=65} [2023-08-23 22:57:50,689 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2023-08-23 22:57:50,689 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 65 transitions, 502 flow [2023-08-23 22:57:50,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:50,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:50,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:50,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-23 22:57:50,690 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:50,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash -648463521, now seen corresponding path program 1 times [2023-08-23 22:57:50,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575539359] [2023-08-23 22:57:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:50,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:57:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:57:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:57:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575539359] [2023-08-23 22:57:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575539359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:57:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:57:50,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:57:50,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123601876] [2023-08-23 22:57:50,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:57:50,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:57:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:57:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:57:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:57:50,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-08-23 22:57:50,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 65 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:50,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:57:50,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-08-23 22:57:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:57:51,606 INFO L124 PetriNetUnfolderBase]: 2093/3456 cut-off events. [2023-08-23 22:57:51,606 INFO L125 PetriNetUnfolderBase]: For 15965/16364 co-relation queries the response was YES. [2023-08-23 22:57:51,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16260 conditions, 3456 events. 2093/3456 cut-off events. For 15965/16364 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19822 event pairs, 411 based on Foata normal form. 75/3414 useless extension candidates. Maximal degree in co-relation 16221. Up to 1861 conditions per place. [2023-08-23 22:57:51,619 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 58 selfloop transitions, 1 changer transitions 64/129 dead transitions. [2023-08-23 22:57:51,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 1243 flow [2023-08-23 22:57:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:57:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:57:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-23 22:57:51,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062761506276151 [2023-08-23 22:57:51,621 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-23 22:57:51,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-23 22:57:51,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:57:51,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-23 22:57:51,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:51,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:51,626 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:51,626 INFO L175 Difference]: Start difference. First operand has 94 places, 65 transitions, 502 flow. Second operand 5 states and 605 transitions. [2023-08-23 22:57:51,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 1243 flow [2023-08-23 22:57:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 1009 flow, removed 74 selfloop flow, removed 15 redundant places. [2023-08-23 22:57:51,664 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 289 flow [2023-08-23 22:57:51,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2023-08-23 22:57:51,665 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-08-23 22:57:51,665 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 289 flow [2023-08-23 22:57:51,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:57:51,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:57:51,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:51,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-23 22:57:51,666 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:57:51,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:57:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1895963541, now seen corresponding path program 2 times [2023-08-23 22:57:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:57:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848697540] [2023-08-23 22:57:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:57:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:57:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:57:51,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 22:57:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:57:51,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 22:57:51,817 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 22:57:51,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 22:57:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 22:57:51,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 22:57:51,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 22:57:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 22:57:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 22:57:51,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 22:57:51,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-23 22:57:51,824 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:57:51,828 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:57:51,829 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:57:51,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:57:51 BasicIcfg [2023-08-23 22:57:51,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:57:51,923 INFO L158 Benchmark]: Toolchain (without parser) took 34402.13ms. Allocated memory was 335.5MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 310.6MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 451.9MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,923 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 335.5MB. Free memory was 313.9MB in the beginning and 313.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:57:51,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.95ms. Allocated memory is still 335.5MB. Free memory was 310.1MB in the beginning and 286.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.93ms. Allocated memory is still 335.5MB. Free memory was 286.0MB in the beginning and 283.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,924 INFO L158 Benchmark]: Boogie Preprocessor took 52.58ms. Allocated memory is still 335.5MB. Free memory was 283.3MB in the beginning and 281.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,924 INFO L158 Benchmark]: RCFGBuilder took 623.37ms. Allocated memory is still 335.5MB. Free memory was 281.2MB in the beginning and 300.1MB in the end (delta: -18.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,924 INFO L158 Benchmark]: TraceAbstraction took 33112.23ms. Allocated memory was 335.5MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 299.1MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 438.9MB. Max. memory is 16.0GB. [2023-08-23 22:57:51,925 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 335.5MB. Free memory was 313.9MB in the beginning and 313.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 528.95ms. Allocated memory is still 335.5MB. Free memory was 310.1MB in the beginning and 286.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.93ms. Allocated memory is still 335.5MB. Free memory was 286.0MB in the beginning and 283.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.58ms. Allocated memory is still 335.5MB. Free memory was 283.3MB in the beginning and 281.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 623.37ms. Allocated memory is still 335.5MB. Free memory was 281.2MB in the beginning and 300.1MB in the end (delta: -18.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.0GB. * TraceAbstraction took 33112.23ms. Allocated memory was 335.5MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 299.1MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 438.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 140 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 33 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 9891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4611, independent: 4352, independent conditional: 0, independent unconditional: 4352, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1718, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4611, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 1718, unknown conditional: 0, unknown unconditional: 1718] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=0, t145={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=1, t145={6:0}, t146={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=2, t145={6:0}, t146={7:0}, t147={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=3, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2902 IncrementalHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 53 mSDtfsCounter, 2902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=757occurred in iteration=15, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-08-23 22:57:51,949 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...