/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:44:56,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:44:56,181 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-24 11:44:56,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:44:56,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:44:56,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:44:56,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:44:56,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:44:56,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:44:56,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:44:56,216 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:44:56,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:44:56,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:44:56,217 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:44:56,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:44:56,219 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:44:56,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:44:56,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:44:56,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:44:56,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:44:56,220 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:44:56,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:44:56,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:56,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:44:56,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:44:56,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:44:56,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:44:56,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:44:56,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:44:56,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:44:56,222 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:44:56,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:44:56,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:44:56,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:44:56,502 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:44:56,503 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:44:56,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-24 11:44:57,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:44:57,761 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:44:57,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-08-24 11:44:57,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bc6d489/47431dff41f443718506b641d08b94f6/FLAG345a1b466 [2023-08-24 11:44:57,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9bc6d489/47431dff41f443718506b641d08b94f6 [2023-08-24 11:44:57,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:44:57,791 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:44:57,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:57,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:44:57,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:44:57,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:57" (1/1) ... [2023-08-24 11:44:57,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e407f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:57, skipping insertion in model container [2023-08-24 11:44:57,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:57" (1/1) ... [2023-08-24 11:44:57,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:44:57,972 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/mix055_tso.oepc.i[949,962] [2023-08-24 11:44:58,149 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:58,157 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:44:58,164 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/mix055_tso.oepc.i[949,962] [2023-08-24 11:44:58,178 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:58,179 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:58,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:58,232 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:58,232 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:58,237 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:44:58,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58 WrapperNode [2023-08-24 11:44:58,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:58,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:58,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:44:58,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:44:58,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,297 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-24 11:44:58,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:58,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:44:58,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:44:58,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:44:58,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:44:58,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:44:58,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:44:58,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:44:58,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (1/1) ... [2023-08-24 11:44:58,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:58,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:44:58,406 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-24 11:44:58,425 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-24 11:44:58,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:44:58,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:44:58,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:44:58,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:44:58,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:44:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:44:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:44:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:44:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:44:58,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:44:58,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:44:58,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:44:58,544 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:44:58,545 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:44:58,882 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:44:58,999 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:44:58,999 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:44:59,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:59 BoogieIcfgContainer [2023-08-24 11:44:59,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:44:59,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:44:59,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:44:59,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:44:59,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:44:57" (1/3) ... [2023-08-24 11:44:59,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a98e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:59, skipping insertion in model container [2023-08-24 11:44:59,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:58" (2/3) ... [2023-08-24 11:44:59,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a98e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:59, skipping insertion in model container [2023-08-24 11:44:59,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:59" (3/3) ... [2023-08-24 11:44:59,008 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-08-24 11:44:59,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:44:59,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:44:59,021 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:44:59,067 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:44:59,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 11:44:59,146 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 11:44:59,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:44:59,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-08-24 11:44:59,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-08-24 11:44:59,163 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:44:59,175 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 11:44:59,178 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-08-24 11:44:59,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-08-24 11:44:59,219 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-24 11:44:59,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:59,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 11:44:59,222 INFO L119 LiptonReduction]: Number of co-enabled transitions 3044 [2023-08-24 11:45:02,297 INFO L134 LiptonReduction]: Checked pairs total: 8921 [2023-08-24 11:45:02,297 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-24 11:45:02,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:45:02,314 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;@39b7028a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:45:02,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:45:02,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:45:02,316 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-24 11:45:02,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:45:02,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:02,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 11:45:02,317 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-24 11:45:02,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 517905549, now seen corresponding path program 1 times [2023-08-24 11:45:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025855617] [2023-08-24 11:45:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:02,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:45:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025855617] [2023-08-24 11:45:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025855617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:45:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791061677] [2023-08-24 11:45:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:02,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:45:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:45:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:45:02,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 233 [2023-08-24 11:45:02,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-24 11:45:02,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:02,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 233 [2023-08-24 11:45:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:03,334 INFO L124 PetriNetUnfolderBase]: 5463/7958 cut-off events. [2023-08-24 11:45:03,335 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-24 11:45:03,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 7958 events. 5463/7958 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47267 event pairs, 1005 based on Foata normal form. 256/7685 useless extension candidates. Maximal degree in co-relation 15546. Up to 5923 conditions per place. [2023-08-24 11:45:03,371 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-08-24 11:45:03,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-08-24 11:45:03,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-24 11:45:03,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493562231759657 [2023-08-24 11:45:03,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-24 11:45:03,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-24 11:45:03,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:03,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-24 11:45:03,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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-24 11:45:03,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-24 11:45:03,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-24 11:45:03,391 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 384 transitions. [2023-08-24 11:45:03,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-08-24 11:45:03,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:03,395 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-24 11:45:03,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-24 11:45:03,399 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 11:45:03,399 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-24 11:45:03,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-24 11:45:03,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:03,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:45:03,400 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-24 11:45:03,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1725633849, now seen corresponding path program 1 times [2023-08-24 11:45:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438266390] [2023-08-24 11:45:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:03,750 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-24 11:45:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:03,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438266390] [2023-08-24 11:45:03,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438266390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:03,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:03,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691277601] [2023-08-24 11:45:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:03,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 11:45:03,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-24 11:45:03,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:03,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 11:45:03,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:05,430 INFO L124 PetriNetUnfolderBase]: 13353/18049 cut-off events. [2023-08-24 11:45:05,430 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2023-08-24 11:45:05,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 18049 events. 13353/18049 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 88558 event pairs, 2064 based on Foata normal form. 747/18796 useless extension candidates. Maximal degree in co-relation 37373. Up to 13062 conditions per place. [2023-08-24 11:45:05,505 INFO L140 encePairwiseOnDemand]: 220/233 looper letters, 48 selfloop transitions, 13 changer transitions 42/103 dead transitions. [2023-08-24 11:45:05,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 103 transitions, 438 flow [2023-08-24 11:45:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2023-08-24 11:45:05,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47700797057020233 [2023-08-24 11:45:05,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 778 transitions. [2023-08-24 11:45:05,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions. [2023-08-24 11:45:05,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:05,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions. [2023-08-24 11:45:05,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 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-24 11:45:05,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:05,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:05,514 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 778 transitions. [2023-08-24 11:45:05,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 103 transitions, 438 flow [2023-08-24 11:45:05,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 103 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:05,517 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 168 flow [2023-08-24 11:45:05,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-24 11:45:05,517 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-08-24 11:45:05,517 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 168 flow [2023-08-24 11:45:05,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-24 11:45:05,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:05,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:05,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:45:05,518 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-24 11:45:05,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1955012510, now seen corresponding path program 1 times [2023-08-24 11:45:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017231505] [2023-08-24 11:45:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:05,912 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-24 11:45:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017231505] [2023-08-24 11:45:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017231505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175696128] [2023-08-24 11:45:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:05,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:05,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:05,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-24 11:45:05,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 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-24 11:45:05,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:05,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-24 11:45:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:07,439 INFO L124 PetriNetUnfolderBase]: 12988/17609 cut-off events. [2023-08-24 11:45:07,440 INFO L125 PetriNetUnfolderBase]: For 15527/15527 co-relation queries the response was YES. [2023-08-24 11:45:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55394 conditions, 17609 events. 12988/17609 cut-off events. For 15527/15527 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 87313 event pairs, 4667 based on Foata normal form. 680/18289 useless extension candidates. Maximal degree in co-relation 55379. Up to 15129 conditions per place. [2023-08-24 11:45:07,500 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 66 selfloop transitions, 23 changer transitions 51/140 dead transitions. [2023-08-24 11:45:07,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 140 transitions, 900 flow [2023-08-24 11:45:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-08-24 11:45:07,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48129981606376454 [2023-08-24 11:45:07,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-08-24 11:45:07,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-08-24 11:45:07,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:07,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-08-24 11:45:07,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-24 11:45:07,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:07,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:07,507 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 168 flow. Second operand 7 states and 785 transitions. [2023-08-24 11:45:07,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 140 transitions, 900 flow [2023-08-24 11:45:07,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 140 transitions, 896 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:07,645 INFO L231 Difference]: Finished difference. Result has 54 places, 61 transitions, 401 flow [2023-08-24 11:45:07,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=54, PETRI_TRANSITIONS=61} [2023-08-24 11:45:07,647 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-08-24 11:45:07,649 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 61 transitions, 401 flow [2023-08-24 11:45:07,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 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-24 11:45:07,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:07,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:07,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:45:07,650 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-24 11:45:07,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1141854111, now seen corresponding path program 1 times [2023-08-24 11:45:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085228791] [2023-08-24 11:45:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:08,150 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-24 11:45:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085228791] [2023-08-24 11:45:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085228791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:08,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868511381] [2023-08-24 11:45:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:08,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:08,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:08,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 11:45:08,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 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-24 11:45:08,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:08,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 11:45:08,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:09,820 INFO L124 PetriNetUnfolderBase]: 12957/17527 cut-off events. [2023-08-24 11:45:09,820 INFO L125 PetriNetUnfolderBase]: For 36193/36193 co-relation queries the response was YES. [2023-08-24 11:45:09,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67790 conditions, 17527 events. 12957/17527 cut-off events. For 36193/36193 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 86231 event pairs, 3798 based on Foata normal form. 552/18079 useless extension candidates. Maximal degree in co-relation 67770. Up to 13770 conditions per place. [2023-08-24 11:45:09,901 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 61 selfloop transitions, 42 changer transitions 35/138 dead transitions. [2023-08-24 11:45:09,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 138 transitions, 1088 flow [2023-08-24 11:45:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2023-08-24 11:45:09,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842632331902718 [2023-08-24 11:45:09,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 677 transitions. [2023-08-24 11:45:09,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 677 transitions. [2023-08-24 11:45:09,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:09,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 677 transitions. [2023-08-24 11:45:09,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 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-24 11:45:09,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:09,907 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:09,907 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 401 flow. Second operand 6 states and 677 transitions. [2023-08-24 11:45:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 138 transitions, 1088 flow [2023-08-24 11:45:10,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 138 transitions, 1074 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:10,151 INFO L231 Difference]: Finished difference. Result has 59 places, 74 transitions, 694 flow [2023-08-24 11:45:10,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=59, PETRI_TRANSITIONS=74} [2023-08-24 11:45:10,152 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-08-24 11:45:10,152 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 74 transitions, 694 flow [2023-08-24 11:45:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 0 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-24 11:45:10,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:10,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:10,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:45:10,153 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-24 11:45:10,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 578547309, now seen corresponding path program 2 times [2023-08-24 11:45:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987458032] [2023-08-24 11:45:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:10,478 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-24 11:45:10,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:10,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987458032] [2023-08-24 11:45:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987458032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114482639] [2023-08-24 11:45:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:10,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:10,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 11:45:10,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 74 transitions, 694 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-24 11:45:10,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:10,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 11:45:10,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:11,877 INFO L124 PetriNetUnfolderBase]: 10965/15095 cut-off events. [2023-08-24 11:45:11,878 INFO L125 PetriNetUnfolderBase]: For 62196/63689 co-relation queries the response was YES. [2023-08-24 11:45:11,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72627 conditions, 15095 events. 10965/15095 cut-off events. For 62196/63689 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 79034 event pairs, 3974 based on Foata normal form. 1287/16020 useless extension candidates. Maximal degree in co-relation 72602. Up to 11617 conditions per place. [2023-08-24 11:45:11,965 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 72 selfloop transitions, 15 changer transitions 27/127 dead transitions. [2023-08-24 11:45:11,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 1334 flow [2023-08-24 11:45:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-24 11:45:11,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133047210300429 [2023-08-24 11:45:11,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-24 11:45:11,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-24 11:45:11,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:11,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-24 11:45:11,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 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-24 11:45:11,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:45:11,970 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:45:11,970 INFO L175 Difference]: Start difference. First operand has 59 places, 74 transitions, 694 flow. Second operand 5 states and 598 transitions. [2023-08-24 11:45:11,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 1334 flow [2023-08-24 11:45:12,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 1292 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:12,037 INFO L231 Difference]: Finished difference. Result has 63 places, 83 transitions, 840 flow [2023-08-24 11:45:12,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=840, PETRI_PLACES=63, PETRI_TRANSITIONS=83} [2023-08-24 11:45:12,038 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-08-24 11:45:12,038 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 83 transitions, 840 flow [2023-08-24 11:45:12,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-24 11:45:12,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:12,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:12,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:45:12,039 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-24 11:45:12,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1945803378, now seen corresponding path program 1 times [2023-08-24 11:45:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308706421] [2023-08-24 11:45:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:12,369 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-24 11:45:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308706421] [2023-08-24 11:45:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308706421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:12,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:12,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949747414] [2023-08-24 11:45:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:12,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:12,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:12,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:12,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 11:45:12,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 83 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 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-24 11:45:12,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:12,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 11:45:12,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:14,109 INFO L124 PetriNetUnfolderBase]: 12784/17321 cut-off events. [2023-08-24 11:45:14,109 INFO L125 PetriNetUnfolderBase]: For 71629/71629 co-relation queries the response was YES. [2023-08-24 11:45:14,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88568 conditions, 17321 events. 12784/17321 cut-off events. For 71629/71629 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 86311 event pairs, 2411 based on Foata normal form. 495/17816 useless extension candidates. Maximal degree in co-relation 88539. Up to 11871 conditions per place. [2023-08-24 11:45:14,395 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 116 selfloop transitions, 62 changer transitions 69/247 dead transitions. [2023-08-24 11:45:14,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 247 transitions, 2718 flow [2023-08-24 11:45:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 11:45:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 11:45:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1225 transitions. [2023-08-24 11:45:14,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779555208739758 [2023-08-24 11:45:14,414 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1225 transitions. [2023-08-24 11:45:14,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1225 transitions. [2023-08-24 11:45:14,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:14,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1225 transitions. [2023-08-24 11:45:14,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.36363636363636) internal successors, (1225), 11 states have internal predecessors, (1225), 0 states have call successors, (0), 0 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-24 11:45:14,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 233.0) internal successors, (2796), 12 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-24 11:45:14,420 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 233.0) internal successors, (2796), 12 states have internal predecessors, (2796), 0 states have call successors, (0), 0 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-24 11:45:14,420 INFO L175 Difference]: Start difference. First operand has 63 places, 83 transitions, 840 flow. Second operand 11 states and 1225 transitions. [2023-08-24 11:45:14,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 247 transitions, 2718 flow [2023-08-24 11:45:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 247 transitions, 2657 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:14,674 INFO L231 Difference]: Finished difference. Result has 78 places, 119 transitions, 1549 flow [2023-08-24 11:45:14,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1549, PETRI_PLACES=78, PETRI_TRANSITIONS=119} [2023-08-24 11:45:14,676 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-24 11:45:14,676 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 119 transitions, 1549 flow [2023-08-24 11:45:14,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 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-24 11:45:14,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:14,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:14,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:45:14,677 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-24 11:45:14,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1715127542, now seen corresponding path program 1 times [2023-08-24 11:45:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973031443] [2023-08-24 11:45:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:15,053 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-24 11:45:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973031443] [2023-08-24 11:45:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973031443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:15,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:15,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079940395] [2023-08-24 11:45:15,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:15,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:15,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 11:45:15,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 119 transitions, 1549 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-24 11:45:15,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:15,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 11:45:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:17,366 INFO L124 PetriNetUnfolderBase]: 16639/22625 cut-off events. [2023-08-24 11:45:17,366 INFO L125 PetriNetUnfolderBase]: For 234671/234671 co-relation queries the response was YES. [2023-08-24 11:45:17,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142993 conditions, 22625 events. 16639/22625 cut-off events. For 234671/234671 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 117988 event pairs, 3099 based on Foata normal form. 646/23271 useless extension candidates. Maximal degree in co-relation 142955. Up to 11310 conditions per place. [2023-08-24 11:45:17,494 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 132 selfloop transitions, 26 changer transitions 63/221 dead transitions. [2023-08-24 11:45:17,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 221 transitions, 3150 flow [2023-08-24 11:45:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-08-24 11:45:17,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47782546494992845 [2023-08-24 11:45:17,496 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-08-24 11:45:17,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-08-24 11:45:17,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:17,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-08-24 11:45:17,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 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-24 11:45:17,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:17,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:17,500 INFO L175 Difference]: Start difference. First operand has 78 places, 119 transitions, 1549 flow. Second operand 6 states and 668 transitions. [2023-08-24 11:45:17,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 221 transitions, 3150 flow [2023-08-24 11:45:18,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 221 transitions, 3046 flow, removed 52 selfloop flow, removed 5 redundant places. [2023-08-24 11:45:18,754 INFO L231 Difference]: Finished difference. Result has 77 places, 113 transitions, 1489 flow [2023-08-24 11:45:18,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1489, PETRI_PLACES=77, PETRI_TRANSITIONS=113} [2023-08-24 11:45:18,754 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2023-08-24 11:45:18,754 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 1489 flow [2023-08-24 11:45:18,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-24 11:45:18,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:18,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:18,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:45:18,755 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-24 11:45:18,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash 732862311, now seen corresponding path program 1 times [2023-08-24 11:45:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:18,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063772401] [2023-08-24 11:45:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:19,074 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-24 11:45:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:19,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063772401] [2023-08-24 11:45:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063772401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:19,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85999709] [2023-08-24 11:45:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:19,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:19,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-24 11:45:19,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 1489 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 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-24 11:45:19,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:19,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-24 11:45:19,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:21,083 INFO L124 PetriNetUnfolderBase]: 15351/21039 cut-off events. [2023-08-24 11:45:21,084 INFO L125 PetriNetUnfolderBase]: For 168315/168315 co-relation queries the response was YES. [2023-08-24 11:45:21,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125583 conditions, 21039 events. 15351/21039 cut-off events. For 168315/168315 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 109782 event pairs, 5994 based on Foata normal form. 554/21593 useless extension candidates. Maximal degree in co-relation 125544. Up to 17257 conditions per place. [2023-08-24 11:45:21,274 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 94 selfloop transitions, 60 changer transitions 64/218 dead transitions. [2023-08-24 11:45:21,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 218 transitions, 3015 flow [2023-08-24 11:45:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-24 11:45:21,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884733292458614 [2023-08-24 11:45:21,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-24 11:45:21,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-24 11:45:21,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:21,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-24 11:45:21,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 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-24 11:45:21,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:21,279 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:21,279 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 1489 flow. Second operand 7 states and 781 transitions. [2023-08-24 11:45:21,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 218 transitions, 3015 flow [2023-08-24 11:45:21,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 218 transitions, 2969 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-24 11:45:21,861 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 1773 flow [2023-08-24 11:45:21,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1773, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2023-08-24 11:45:21,861 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-08-24 11:45:21,861 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 1773 flow [2023-08-24 11:45:21,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 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-24 11:45:21,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:21,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:21,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:45:21,862 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-24 11:45:21,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:21,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1695038168, now seen corresponding path program 1 times [2023-08-24 11:45:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842786250] [2023-08-24 11:45:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:22,352 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-24 11:45:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842786250] [2023-08-24 11:45:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842786250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694371414] [2023-08-24 11:45:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:22,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:22,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:22,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-24 11:45:22,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 1773 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 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-24 11:45:22,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:22,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-24 11:45:22,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:24,335 INFO L124 PetriNetUnfolderBase]: 12974/18254 cut-off events. [2023-08-24 11:45:24,335 INFO L125 PetriNetUnfolderBase]: For 192098/192935 co-relation queries the response was YES. [2023-08-24 11:45:24,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120254 conditions, 18254 events. 12974/18254 cut-off events. For 192098/192935 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 101101 event pairs, 4722 based on Foata normal form. 925/19027 useless extension candidates. Maximal degree in co-relation 120210. Up to 13006 conditions per place. [2023-08-24 11:45:24,437 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 106 selfloop transitions, 32 changer transitions 35/190 dead transitions. [2023-08-24 11:45:24,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 2883 flow [2023-08-24 11:45:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2023-08-24 11:45:24,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076640098099325 [2023-08-24 11:45:24,439 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2023-08-24 11:45:24,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2023-08-24 11:45:24,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:24,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2023-08-24 11:45:24,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-24 11:45:24,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:24,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:24,442 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 1773 flow. Second operand 7 states and 828 transitions. [2023-08-24 11:45:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 2883 flow [2023-08-24 11:45:24,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 190 transitions, 2853 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:24,780 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 1939 flow [2023-08-24 11:45:24,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1939, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2023-08-24 11:45:24,781 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2023-08-24 11:45:24,781 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 1939 flow [2023-08-24 11:45:24,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 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-24 11:45:24,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:24,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:24,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:45:24,781 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-24 11:45:24,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:24,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1653479723, now seen corresponding path program 1 times [2023-08-24 11:45:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:24,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930026270] [2023-08-24 11:45:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:24,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:25,155 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-24 11:45:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:25,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930026270] [2023-08-24 11:45:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930026270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470026783] [2023-08-24 11:45:25,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:25,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-24 11:45:25,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 1939 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-24 11:45:25,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:25,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-24 11:45:25,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:28,099 INFO L124 PetriNetUnfolderBase]: 17947/24504 cut-off events. [2023-08-24 11:45:28,099 INFO L125 PetriNetUnfolderBase]: For 285064/285064 co-relation queries the response was YES. [2023-08-24 11:45:28,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167624 conditions, 24504 events. 17947/24504 cut-off events. For 285064/285064 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 131147 event pairs, 5946 based on Foata normal form. 465/24969 useless extension candidates. Maximal degree in co-relation 167577. Up to 18409 conditions per place. [2023-08-24 11:45:28,234 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 126 selfloop transitions, 107 changer transitions 44/277 dead transitions. [2023-08-24 11:45:28,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 277 transitions, 4363 flow [2023-08-24 11:45:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 11:45:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 11:45:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1106 transitions. [2023-08-24 11:45:28,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47467811158798284 [2023-08-24 11:45:28,237 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1106 transitions. [2023-08-24 11:45:28,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1106 transitions. [2023-08-24 11:45:28,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:28,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1106 transitions. [2023-08-24 11:45:28,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:28,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 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-24 11:45:28,241 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 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-24 11:45:28,241 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 1939 flow. Second operand 10 states and 1106 transitions. [2023-08-24 11:45:28,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 277 transitions, 4363 flow [2023-08-24 11:45:29,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 277 transitions, 4275 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:29,097 INFO L231 Difference]: Finished difference. Result has 98 places, 176 transitions, 3247 flow [2023-08-24 11:45:29,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3247, PETRI_PLACES=98, PETRI_TRANSITIONS=176} [2023-08-24 11:45:29,098 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-24 11:45:29,098 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 176 transitions, 3247 flow [2023-08-24 11:45:29,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-24 11:45:29,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:29,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:29,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:45:29,099 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-24 11:45:29,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1638257483, now seen corresponding path program 2 times [2023-08-24 11:45:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839226355] [2023-08-24 11:45:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:29,302 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-24 11:45:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:29,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839226355] [2023-08-24 11:45:29,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839226355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:29,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:29,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:29,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789981491] [2023-08-24 11:45:29,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:29,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:29,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:29,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:29,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-24 11:45:29,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 176 transitions, 3247 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 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-24 11:45:29,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:29,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-24 11:45:29,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:32,266 INFO L124 PetriNetUnfolderBase]: 15797/22153 cut-off events. [2023-08-24 11:45:32,266 INFO L125 PetriNetUnfolderBase]: For 339091/339997 co-relation queries the response was YES. [2023-08-24 11:45:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171062 conditions, 22153 events. 15797/22153 cut-off events. For 339091/339997 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 125711 event pairs, 5598 based on Foata normal form. 1090/23052 useless extension candidates. Maximal degree in co-relation 171009. Up to 16041 conditions per place. [2023-08-24 11:45:32,461 INFO L140 encePairwiseOnDemand]: 223/233 looper letters, 152 selfloop transitions, 57 changer transitions 15/252 dead transitions. [2023-08-24 11:45:32,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 252 transitions, 4680 flow [2023-08-24 11:45:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2023-08-24 11:45:32,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107296137339056 [2023-08-24 11:45:32,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2023-08-24 11:45:32,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2023-08-24 11:45:32,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:32,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2023-08-24 11:45:32,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 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-24 11:45:32,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:32,466 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:32,466 INFO L175 Difference]: Start difference. First operand has 98 places, 176 transitions, 3247 flow. Second operand 6 states and 714 transitions. [2023-08-24 11:45:32,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 252 transitions, 4680 flow [2023-08-24 11:45:33,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 252 transitions, 4559 flow, removed 60 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:33,196 INFO L231 Difference]: Finished difference. Result has 98 places, 193 transitions, 3691 flow [2023-08-24 11:45:33,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3166, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3691, PETRI_PLACES=98, PETRI_TRANSITIONS=193} [2023-08-24 11:45:33,197 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2023-08-24 11:45:33,197 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 193 transitions, 3691 flow [2023-08-24 11:45:33,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 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-24 11:45:33,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:33,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:33,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:45:33,198 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-24 11:45:33,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash -382249703, now seen corresponding path program 3 times [2023-08-24 11:45:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544611641] [2023-08-24 11:45:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:33,741 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-24 11:45:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544611641] [2023-08-24 11:45:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544611641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:33,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:33,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786533050] [2023-08-24 11:45:33,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:33,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:45:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:45:33,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:45:33,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 233 [2023-08-24 11:45:33,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 193 transitions, 3691 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 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-24 11:45:33,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:33,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 233 [2023-08-24 11:45:33,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:36,875 INFO L124 PetriNetUnfolderBase]: 16058/22586 cut-off events. [2023-08-24 11:45:36,875 INFO L125 PetriNetUnfolderBase]: For 354650/355435 co-relation queries the response was YES. [2023-08-24 11:45:36,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179592 conditions, 22586 events. 16058/22586 cut-off events. For 354650/355435 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 129932 event pairs, 4823 based on Foata normal form. 1100/23526 useless extension candidates. Maximal degree in co-relation 179539. Up to 14293 conditions per place. [2023-08-24 11:45:37,025 INFO L140 encePairwiseOnDemand]: 224/233 looper letters, 163 selfloop transitions, 42 changer transitions 28/261 dead transitions. [2023-08-24 11:45:37,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 261 transitions, 5108 flow [2023-08-24 11:45:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2023-08-24 11:45:37,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49049662783568365 [2023-08-24 11:45:37,040 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2023-08-24 11:45:37,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2023-08-24 11:45:37,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:37,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2023-08-24 11:45:37,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-24 11:45:37,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:37,055 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:37,055 INFO L175 Difference]: Start difference. First operand has 98 places, 193 transitions, 3691 flow. Second operand 7 states and 800 transitions. [2023-08-24 11:45:37,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 261 transitions, 5108 flow [2023-08-24 11:45:37,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 261 transitions, 4963 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:37,819 INFO L231 Difference]: Finished difference. Result has 102 places, 199 transitions, 3844 flow [2023-08-24 11:45:37,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3550, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3844, PETRI_PLACES=102, PETRI_TRANSITIONS=199} [2023-08-24 11:45:37,821 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2023-08-24 11:45:37,821 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 199 transitions, 3844 flow [2023-08-24 11:45:37,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 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-24 11:45:37,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:37,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:37,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:45:37,822 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-24 11:45:37,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 324820390, now seen corresponding path program 1 times [2023-08-24 11:45:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84307274] [2023-08-24 11:45:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:38,025 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-24 11:45:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84307274] [2023-08-24 11:45:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84307274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:38,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:38,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:45:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657548683] [2023-08-24 11:45:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:45:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:45:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:45:38,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 11:45:38,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 199 transitions, 3844 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-24 11:45:38,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:38,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 11:45:38,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:39,929 INFO L124 PetriNetUnfolderBase]: 9107/13102 cut-off events. [2023-08-24 11:45:39,930 INFO L125 PetriNetUnfolderBase]: For 331630/338654 co-relation queries the response was YES. [2023-08-24 11:45:39,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114664 conditions, 13102 events. 9107/13102 cut-off events. For 331630/338654 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 74906 event pairs, 2693 based on Foata normal form. 1701/14427 useless extension candidates. Maximal degree in co-relation 114609. Up to 10081 conditions per place. [2023-08-24 11:45:40,027 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 180 selfloop transitions, 5 changer transitions 10/225 dead transitions. [2023-08-24 11:45:40,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 225 transitions, 4740 flow [2023-08-24 11:45:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:45:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:45:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-24 11:45:40,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207439198855508 [2023-08-24 11:45:40,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-24 11:45:40,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-24 11:45:40,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:40,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-24 11:45:40,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-24 11:45:40,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 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-24 11:45:40,031 INFO L175 Difference]: Start difference. First operand has 102 places, 199 transitions, 3844 flow. Second operand 3 states and 364 transitions. [2023-08-24 11:45:40,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 225 transitions, 4740 flow [2023-08-24 11:45:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 225 transitions, 4488 flow, removed 50 selfloop flow, removed 7 redundant places. [2023-08-24 11:45:40,277 INFO L231 Difference]: Finished difference. Result has 96 places, 167 transitions, 2990 flow [2023-08-24 11:45:40,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2990, PETRI_PLACES=96, PETRI_TRANSITIONS=167} [2023-08-24 11:45:40,278 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2023-08-24 11:45:40,278 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 167 transitions, 2990 flow [2023-08-24 11:45:40,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 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-24 11:45:40,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:40,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:40,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:45:40,278 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-24 11:45:40,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash -135853254, now seen corresponding path program 1 times [2023-08-24 11:45:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524955680] [2023-08-24 11:45:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:40,405 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-24 11:45:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524955680] [2023-08-24 11:45:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524955680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:40,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:45:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144166218] [2023-08-24 11:45:40,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:40,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:45:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:45:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:45:40,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 11:45:40,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 167 transitions, 2990 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:40,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:40,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 11:45:40,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:41,283 INFO L124 PetriNetUnfolderBase]: 4266/6491 cut-off events. [2023-08-24 11:45:41,283 INFO L125 PetriNetUnfolderBase]: For 144621/147121 co-relation queries the response was YES. [2023-08-24 11:45:41,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56138 conditions, 6491 events. 4266/6491 cut-off events. For 144621/147121 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35874 event pairs, 709 based on Foata normal form. 973/7323 useless extension candidates. Maximal degree in co-relation 56087. Up to 3586 conditions per place. [2023-08-24 11:45:41,323 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 194 selfloop transitions, 9 changer transitions 22/255 dead transitions. [2023-08-24 11:45:41,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 255 transitions, 5067 flow [2023-08-24 11:45:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:45:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:45:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-24 11:45:41,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225321888412017 [2023-08-24 11:45:41,324 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-24 11:45:41,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-24 11:45:41,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:41,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-24 11:45:41,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 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-24 11:45:41,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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-24 11:45:41,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 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-24 11:45:41,327 INFO L175 Difference]: Start difference. First operand has 96 places, 167 transitions, 2990 flow. Second operand 4 states and 487 transitions. [2023-08-24 11:45:41,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 255 transitions, 5067 flow [2023-08-24 11:45:41,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 255 transitions, 5028 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-24 11:45:41,430 INFO L231 Difference]: Finished difference. Result has 99 places, 154 transitions, 2695 flow [2023-08-24 11:45:41,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2837, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2695, PETRI_PLACES=99, PETRI_TRANSITIONS=154} [2023-08-24 11:45:41,431 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2023-08-24 11:45:41,431 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 154 transitions, 2695 flow [2023-08-24 11:45:41,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:41,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:41,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:41,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:45:41,431 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-24 11:45:41,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1549263549, now seen corresponding path program 1 times [2023-08-24 11:45:41,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:41,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160920283] [2023-08-24 11:45:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:41,676 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-24 11:45:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160920283] [2023-08-24 11:45:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160920283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16054801] [2023-08-24 11:45:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:41,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:41,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:41,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 11:45:41,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 154 transitions, 2695 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:41,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:41,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 11:45:41,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:43,375 INFO L124 PetriNetUnfolderBase]: 7424/11236 cut-off events. [2023-08-24 11:45:43,375 INFO L125 PetriNetUnfolderBase]: For 203605/203605 co-relation queries the response was YES. [2023-08-24 11:45:43,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96022 conditions, 11236 events. 7424/11236 cut-off events. For 203605/203605 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 65160 event pairs, 843 based on Foata normal form. 124/11360 useless extension candidates. Maximal degree in co-relation 95969. Up to 6035 conditions per place. [2023-08-24 11:45:43,432 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 186 selfloop transitions, 62 changer transitions 126/374 dead transitions. [2023-08-24 11:45:43,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 374 transitions, 6817 flow [2023-08-24 11:45:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-24 11:45:43,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884733292458614 [2023-08-24 11:45:43,434 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-24 11:45:43,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-24 11:45:43,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:43,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-24 11:45:43,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 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-24 11:45:43,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:43,437 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:43,437 INFO L175 Difference]: Start difference. First operand has 99 places, 154 transitions, 2695 flow. Second operand 7 states and 781 transitions. [2023-08-24 11:45:43,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 374 transitions, 6817 flow [2023-08-24 11:45:43,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 374 transitions, 6689 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-24 11:45:43,624 INFO L231 Difference]: Finished difference. Result has 107 places, 168 transitions, 3169 flow [2023-08-24 11:45:43,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3169, PETRI_PLACES=107, PETRI_TRANSITIONS=168} [2023-08-24 11:45:43,625 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2023-08-24 11:45:43,625 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 168 transitions, 3169 flow [2023-08-24 11:45:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:45:43,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:43,625 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-24 11:45:43,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 11:45:43,625 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-24 11:45:43,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash -945239276, now seen corresponding path program 1 times [2023-08-24 11:45:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002726746] [2023-08-24 11:45:43,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:43,747 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-24 11:45:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002726746] [2023-08-24 11:45:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002726746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:43,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:45:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581679081] [2023-08-24 11:45:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:45:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:45:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:45:43,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 11:45:43,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 168 transitions, 3169 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-24 11:45:43,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:43,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 11:45:43,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:44,520 INFO L124 PetriNetUnfolderBase]: 4156/6380 cut-off events. [2023-08-24 11:45:44,521 INFO L125 PetriNetUnfolderBase]: For 154364/156535 co-relation queries the response was YES. [2023-08-24 11:45:44,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56907 conditions, 6380 events. 4156/6380 cut-off events. For 154364/156535 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 36758 event pairs, 436 based on Foata normal form. 781/7043 useless extension candidates. Maximal degree in co-relation 56850. Up to 3534 conditions per place. [2023-08-24 11:45:44,559 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 194 selfloop transitions, 13 changer transitions 33/271 dead transitions. [2023-08-24 11:45:44,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 271 transitions, 5672 flow [2023-08-24 11:45:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:45:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:45:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-24 11:45:44,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-08-24 11:45:44,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-24 11:45:44,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-24 11:45:44,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:44,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-24 11:45:44,561 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-24 11:45:44,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:45:44,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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-24 11:45:44,563 INFO L175 Difference]: Start difference. First operand has 107 places, 168 transitions, 3169 flow. Second operand 5 states and 608 transitions. [2023-08-24 11:45:44,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 271 transitions, 5672 flow [2023-08-24 11:45:44,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 271 transitions, 5517 flow, removed 48 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:44,818 INFO L231 Difference]: Finished difference. Result has 107 places, 150 transitions, 2713 flow [2023-08-24 11:45:44,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2713, PETRI_PLACES=107, PETRI_TRANSITIONS=150} [2023-08-24 11:45:44,818 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places. [2023-08-24 11:45:44,819 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 150 transitions, 2713 flow [2023-08-24 11:45:44,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-24 11:45:44,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:44,819 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] [2023-08-24 11:45:44,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-24 11:45:44,819 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-24 11:45:44,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1027359921, now seen corresponding path program 1 times [2023-08-24 11:45:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031342616] [2023-08-24 11:45:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:45,486 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-24 11:45:45,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031342616] [2023-08-24 11:45:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031342616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 11:45:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333639936] [2023-08-24 11:45:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:45,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 11:45:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 11:45:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-24 11:45:45,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 233 [2023-08-24 11:45:45,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 150 transitions, 2713 flow. Second operand has 10 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 0 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-24 11:45:45,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:45,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 233 [2023-08-24 11:45:45,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:47,143 INFO L124 PetriNetUnfolderBase]: 7625/11762 cut-off events. [2023-08-24 11:45:47,143 INFO L125 PetriNetUnfolderBase]: For 210851/210851 co-relation queries the response was YES. [2023-08-24 11:45:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98806 conditions, 11762 events. 7625/11762 cut-off events. For 210851/210851 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 71919 event pairs, 882 based on Foata normal form. 24/11786 useless extension candidates. Maximal degree in co-relation 98749. Up to 5493 conditions per place. [2023-08-24 11:45:47,216 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 200 selfloop transitions, 97 changer transitions 52/349 dead transitions. [2023-08-24 11:45:47,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 349 transitions, 6257 flow [2023-08-24 11:45:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 11:45:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 11:45:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1241 transitions. [2023-08-24 11:45:47,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438483547925608 [2023-08-24 11:45:47,219 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1241 transitions. [2023-08-24 11:45:47,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1241 transitions. [2023-08-24 11:45:47,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:47,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1241 transitions. [2023-08-24 11:45:47,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 103.41666666666667) internal successors, (1241), 12 states have internal predecessors, (1241), 0 states have call successors, (0), 0 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-24 11:45:47,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 233.0) internal successors, (3029), 13 states have internal predecessors, (3029), 0 states have call successors, (0), 0 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-24 11:45:47,224 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 233.0) internal successors, (3029), 13 states have internal predecessors, (3029), 0 states have call successors, (0), 0 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-24 11:45:47,224 INFO L175 Difference]: Start difference. First operand has 107 places, 150 transitions, 2713 flow. Second operand 12 states and 1241 transitions. [2023-08-24 11:45:47,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 349 transitions, 6257 flow [2023-08-24 11:45:48,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 349 transitions, 6005 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-24 11:45:48,014 INFO L231 Difference]: Finished difference. Result has 122 places, 177 transitions, 3635 flow [2023-08-24 11:45:48,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=177} [2023-08-24 11:45:48,014 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places. [2023-08-24 11:45:48,014 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 177 transitions, 3635 flow [2023-08-24 11:45:48,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.4) internal successors, (934), 10 states have internal predecessors, (934), 0 states have call successors, (0), 0 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-24 11:45:48,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:48,015 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] [2023-08-24 11:45:48,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 11:45:48,015 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-24 11:45:48,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash -541380358, now seen corresponding path program 1 times [2023-08-24 11:45:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:48,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204559807] [2023-08-24 11:45:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:48,222 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-24 11:45:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204559807] [2023-08-24 11:45:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204559807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069704721] [2023-08-24 11:45:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:48,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:48,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-08-24 11:45:48,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 177 transitions, 3635 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-24 11:45:48,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:48,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-08-24 11:45:48,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:50,158 INFO L124 PetriNetUnfolderBase]: 8924/14056 cut-off events. [2023-08-24 11:45:50,158 INFO L125 PetriNetUnfolderBase]: For 307486/307486 co-relation queries the response was YES. [2023-08-24 11:45:50,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121016 conditions, 14056 events. 8924/14056 cut-off events. For 307486/307486 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 90841 event pairs, 1792 based on Foata normal form. 37/14093 useless extension candidates. Maximal degree in co-relation 120952. Up to 6716 conditions per place. [2023-08-24 11:45:50,230 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 174 selfloop transitions, 47 changer transitions 158/379 dead transitions. [2023-08-24 11:45:50,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 379 transitions, 7963 flow [2023-08-24 11:45:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:45:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:45:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2023-08-24 11:45:50,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46842427958307786 [2023-08-24 11:45:50,232 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2023-08-24 11:45:50,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2023-08-24 11:45:50,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:50,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2023-08-24 11:45:50,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 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-24 11:45:50,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:50,235 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-24 11:45:50,235 INFO L175 Difference]: Start difference. First operand has 122 places, 177 transitions, 3635 flow. Second operand 7 states and 764 transitions. [2023-08-24 11:45:50,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 379 transitions, 7963 flow [2023-08-24 11:45:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 379 transitions, 7922 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-24 11:45:50,864 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 3104 flow [2023-08-24 11:45:50,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=3622, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3104, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2023-08-24 11:45:50,864 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places. [2023-08-24 11:45:50,864 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 3104 flow [2023-08-24 11:45:50,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 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-24 11:45:50,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:50,865 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] [2023-08-24 11:45:50,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 11:45:50,865 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-24 11:45:50,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -808871141, now seen corresponding path program 2 times [2023-08-24 11:45:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:50,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509116429] [2023-08-24 11:45:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:50,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:50,988 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-24 11:45:50,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509116429] [2023-08-24 11:45:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509116429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:50,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:45:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599276728] [2023-08-24 11:45:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:50,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:45:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:50,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:45:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:45:50,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-08-24 11:45:50,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 3104 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 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-24 11:45:50,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:50,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-08-24 11:45:50,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:52,109 INFO L124 PetriNetUnfolderBase]: 5174/8289 cut-off events. [2023-08-24 11:45:52,109 INFO L125 PetriNetUnfolderBase]: For 224845/227228 co-relation queries the response was YES. [2023-08-24 11:45:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73084 conditions, 8289 events. 5174/8289 cut-off events. For 224845/227228 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 54928 event pairs, 527 based on Foata normal form. 521/8617 useless extension candidates. Maximal degree in co-relation 73021. Up to 3843 conditions per place. [2023-08-24 11:45:52,149 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 82 selfloop transitions, 17 changer transitions 153/260 dead transitions. [2023-08-24 11:45:52,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 260 transitions, 5973 flow [2023-08-24 11:45:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:45:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:45:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-24 11:45:52,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114449213161659 [2023-08-24 11:45:52,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-24 11:45:52,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-24 11:45:52,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:52,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-24 11:45:52,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-24 11:45:52,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:52,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 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-24 11:45:52,153 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 3104 flow. Second operand 6 states and 715 transitions. [2023-08-24 11:45:52,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 260 transitions, 5973 flow [2023-08-24 11:45:52,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 260 transitions, 5561 flow, removed 106 selfloop flow, removed 4 redundant places. [2023-08-24 11:45:52,638 INFO L231 Difference]: Finished difference. Result has 123 places, 62 transitions, 971 flow [2023-08-24 11:45:52,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=971, PETRI_PLACES=123, PETRI_TRANSITIONS=62} [2023-08-24 11:45:52,638 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2023-08-24 11:45:52,639 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 62 transitions, 971 flow [2023-08-24 11:45:52,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 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-24 11:45:52,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:52,639 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] [2023-08-24 11:45:52,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 11:45:52,639 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:52,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1776386699, now seen corresponding path program 1 times [2023-08-24 11:45:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:52,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405915452] [2023-08-24 11:45:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:45:53,448 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-24 11:45:53,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:45:53,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405915452] [2023-08-24 11:45:53,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405915452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:45:53,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:45:53,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 11:45:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714805449] [2023-08-24 11:45:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:45:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 11:45:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:45:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 11:45:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-24 11:45:53,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-24 11:45:53,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 62 transitions, 971 flow. Second operand has 11 states, 11 states have (on average 100.27272727272727) internal successors, (1103), 11 states have internal predecessors, (1103), 0 states have call successors, (0), 0 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-24 11:45:53,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:45:53,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-24 11:45:53,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:45:53,937 INFO L124 PetriNetUnfolderBase]: 1570/2629 cut-off events. [2023-08-24 11:45:53,938 INFO L125 PetriNetUnfolderBase]: For 42855/42882 co-relation queries the response was YES. [2023-08-24 11:45:53,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19408 conditions, 2629 events. 1570/2629 cut-off events. For 42855/42882 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13851 event pairs, 267 based on Foata normal form. 2/2620 useless extension candidates. Maximal degree in co-relation 19364. Up to 972 conditions per place. [2023-08-24 11:45:53,949 INFO L140 encePairwiseOnDemand]: 225/233 looper letters, 78 selfloop transitions, 8 changer transitions 51/140 dead transitions. [2023-08-24 11:45:53,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 140 transitions, 2055 flow [2023-08-24 11:45:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:45:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:45:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2023-08-24 11:45:53,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613733905579399 [2023-08-24 11:45:53,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2023-08-24 11:45:53,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2023-08-24 11:45:53,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:45:53,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2023-08-24 11:45:53,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 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-24 11:45:53,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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-24 11:45:53,953 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 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-24 11:45:53,953 INFO L175 Difference]: Start difference. First operand has 123 places, 62 transitions, 971 flow. Second operand 8 states and 860 transitions. [2023-08-24 11:45:53,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 140 transitions, 2055 flow [2023-08-24 11:45:54,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 1259 flow, removed 266 selfloop flow, removed 41 redundant places. [2023-08-24 11:45:54,022 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 491 flow [2023-08-24 11:45:54,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2023-08-24 11:45:54,022 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-08-24 11:45:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 491 flow [2023-08-24 11:45:54,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.27272727272727) internal successors, (1103), 11 states have internal predecessors, (1103), 0 states have call successors, (0), 0 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-24 11:45:54,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:45:54,023 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] [2023-08-24 11:45:54,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 11:45:54,023 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:45:54,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:45:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1824657141, now seen corresponding path program 2 times [2023-08-24 11:45:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:45:54,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723652617] [2023-08-24 11:45:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:45:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:45:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:54,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:45:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:45:54,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:45:54,114 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:45:54,115 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:45:54,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:45:54,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:45:54,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:45:54,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:45:54,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:45:54,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:45:54,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 11:45:54,117 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:45:54,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:45:54,120 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:45:54,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:45:54 BasicIcfg [2023-08-24 11:45:54,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:45:54,180 INFO L158 Benchmark]: Toolchain (without parser) took 56389.40ms. Allocated memory was 350.2MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 320.6MB in the beginning and 7.5GB in the end (delta: -7.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-24 11:45:54,180 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 326.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:45:54,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.20ms. Allocated memory is still 350.2MB. Free memory was 320.6MB in the beginning and 296.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:54,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.11ms. Allocated memory is still 350.2MB. Free memory was 296.1MB in the beginning and 293.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 11:45:54,180 INFO L158 Benchmark]: Boogie Preprocessor took 32.90ms. Allocated memory is still 350.2MB. Free memory was 292.9MB in the beginning and 291.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:54,181 INFO L158 Benchmark]: RCFGBuilder took 670.55ms. Allocated memory is still 350.2MB. Free memory was 291.3MB in the beginning and 302.2MB in the end (delta: -11.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:45:54,181 INFO L158 Benchmark]: TraceAbstraction took 55176.13ms. Allocated memory was 350.2MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 301.4MB in the beginning and 7.5GB in the end (delta: -7.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-24 11:45:54,181 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 326.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 446.20ms. Allocated memory is still 350.2MB. Free memory was 320.6MB in the beginning and 296.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.11ms. Allocated memory is still 350.2MB. Free memory was 296.1MB in the beginning and 293.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.90ms. Allocated memory is still 350.2MB. Free memory was 292.9MB in the beginning and 291.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 670.55ms. Allocated memory is still 350.2MB. Free memory was 291.3MB in the beginning and 302.2MB in the end (delta: -11.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 55176.13ms. Allocated memory was 350.2MB in the beginning and 9.7GB in the end (delta: 9.4GB). Free memory was 301.4MB in the beginning and 7.5GB in the end (delta: -7.2GB). Peak memory consumption was 2.2GB. 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: 3.1s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 32 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 8921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3359, independent: 3121, independent conditional: 0, independent unconditional: 3121, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3359, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, 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_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-3, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-2, t1481={5:0}, t1482={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] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={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] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L784] 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) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 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 [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L754] 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) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 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 [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L804] 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) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 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 [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L824] 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) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 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 [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 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_p3_EAX=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=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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_p3_EAX=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, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] 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_p3_EAX=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=2] - 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: 851]: 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: 849]: 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: 853]: 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: 847]: 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, 164 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: 55.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 44.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1107 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3679 IncrementalHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 119 mSDtfsCounter, 3679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3844occurred in iteration=12, InterpolantAutomatonStates: 134, 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, 6.3s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 4022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-24 11:45:54,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...