/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:09:45,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:09:45,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:09:45,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:09:45,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:09:45,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:09:45,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:09:45,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:09:45,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:09:45,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:09:45,698 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:09:45,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:09:45,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:09:45,699 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:09:45,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:09:45,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:09:45,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:09:45,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:09:45,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:09:45,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:09:45,701 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:09:45,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:09:45,701 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:09:45,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:09:45,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:09:45,702 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:09:45,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:09:45,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:09:45,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:09:45,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:09:45,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:09:45,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:09:45,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:09:45,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:09:45,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:09:45,705 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 23:09:46,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:09:46,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:09:46,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:09:46,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:09:46,038 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:09:46,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-08-23 23:09:47,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:09:47,663 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:09:47,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2023-08-23 23:09:47,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b9115a2/1b154ff2ccb446429de505ceb60b2a7d/FLAG9055a029a [2023-08-23 23:09:47,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23b9115a2/1b154ff2ccb446429de505ceb60b2a7d [2023-08-23 23:09:47,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:09:47,714 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:09:47,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:09:47,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:09:47,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:09:47,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:09:47" (1/1) ... [2023-08-23 23:09:47,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45980087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:47, skipping insertion in model container [2023-08-23 23:09:47,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:09:47" (1/1) ... [2023-08-23 23:09:47,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:09:47,943 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2023-08-23 23:09:48,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:09:48,153 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:09:48,163 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i[993,1006] [2023-08-23 23:09:48,171 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:09:48,172 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:09:48,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:09:48,233 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:09:48,233 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:09:48,240 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:09:48,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48 WrapperNode [2023-08-23 23:09:48,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:09:48,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:09:48,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:09:48,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:09:48,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,325 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 188 [2023-08-23 23:09:48,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:09:48,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:09:48,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:09:48,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:09:48,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:09:48,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:09:48,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:09:48,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:09:48,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (1/1) ... [2023-08-23 23:09:48,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:09:48,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:09:48,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 23:09:48,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 23:09:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:09:48,461 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:09:48,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:09:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:09:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:09:48,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:09:48,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:09:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:09:48,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:09:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:09:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:09:48,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:09:48,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:09:48,465 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:09:48,630 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:09:48,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:09:49,128 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:09:49,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:09:49,346 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:09:49,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:09:49 BoogieIcfgContainer [2023-08-23 23:09:49,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:09:49,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:09:49,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:09:49,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:09:49,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:09:47" (1/3) ... [2023-08-23 23:09:49,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df8c8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:09:49, skipping insertion in model container [2023-08-23 23:09:49,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:09:48" (2/3) ... [2023-08-23 23:09:49,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df8c8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:09:49, skipping insertion in model container [2023-08-23 23:09:49,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:09:49" (3/3) ... [2023-08-23 23:09:49,358 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2023-08-23 23:09:49,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:09:49,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-23 23:09:49,373 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:09:49,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:09:49,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-23 23:09:49,558 INFO L124 PetriNetUnfolderBase]: 2/138 cut-off events. [2023-08-23 23:09:49,559 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:09:49,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-08-23 23:09:49,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-23 23:09:49,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2023-08-23 23:09:49,577 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:09:49,586 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2023-08-23 23:09:49,589 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2023-08-23 23:09:49,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2023-08-23 23:09:49,627 INFO L124 PetriNetUnfolderBase]: 1/124 cut-off events. [2023-08-23 23:09:49,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:09:49,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-23 23:09:49,631 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-08-23 23:09:58,291 INFO L134 LiptonReduction]: Checked pairs total: 4311 [2023-08-23 23:09:58,291 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-23 23:09:58,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:09:58,309 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;@2653638e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:09:58,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-23 23:09:58,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:09:58,316 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-23 23:09:58,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:09:58,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:09:58,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:09:58,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:09:58,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:09:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash -733799435, now seen corresponding path program 1 times [2023-08-23 23:09:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:09:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535102122] [2023-08-23 23:09:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:09:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:09:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:09:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:09:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:09:58,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535102122] [2023-08-23 23:09:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535102122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:09:58,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:09:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:09:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825381770] [2023-08-23 23:09:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:09:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:09:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:09:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:09:58,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:09:58,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-08-23 23:09:58,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:58,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:09:58,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-08-23 23:09:58,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:09:59,364 INFO L124 PetriNetUnfolderBase]: 2185/3052 cut-off events. [2023-08-23 23:09:59,365 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-23 23:09:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 3052 events. 2185/3052 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13281 event pairs, 721 based on Foata normal form. 32/3081 useless extension candidates. Maximal degree in co-relation 6226. Up to 2745 conditions per place. [2023-08-23 23:09:59,388 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 36 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-08-23 23:09:59,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 179 flow [2023-08-23 23:09:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:09:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:09:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-23 23:09:59,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-08-23 23:09:59,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-23 23:09:59,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-23 23:09:59,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:09:59,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-23 23:09:59,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:59,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:59,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:59,427 INFO L175 Difference]: Start difference. First operand has 36 places, 23 transitions, 58 flow. Second operand 3 states and 418 transitions. [2023-08-23 23:09:59,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 179 flow [2023-08-23 23:09:59,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:09:59,434 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-08-23 23:09:59,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-08-23 23:09:59,441 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-08-23 23:09:59,441 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-08-23 23:09:59,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:59,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:09:59,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:09:59,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:09:59,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:09:59,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:09:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1272947893, now seen corresponding path program 1 times [2023-08-23 23:09:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:09:59,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381015247] [2023-08-23 23:09:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:09:59,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:09:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:09:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:09:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:09:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381015247] [2023-08-23 23:09:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381015247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:09:59,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:09:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:09:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892726388] [2023-08-23 23:09:59,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:09:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:09:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:09:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:09:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:09:59,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 246 [2023-08-23 23:09:59,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:09:59,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:09:59,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 246 [2023-08-23 23:09:59,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:00,297 INFO L124 PetriNetUnfolderBase]: 1826/2746 cut-off events. [2023-08-23 23:10:00,297 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-23 23:10:00,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5954 conditions, 2746 events. 1826/2746 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13585 event pairs, 364 based on Foata normal form. 40/2785 useless extension candidates. Maximal degree in co-relation 5943. Up to 2100 conditions per place. [2023-08-23 23:10:00,317 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 32 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-23 23:10:00,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 172 flow [2023-08-23 23:10:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-23 23:10:00,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5650406504065041 [2023-08-23 23:10:00,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-23 23:10:00,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-23 23:10:00,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:00,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-23 23:10:00,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:00,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:00,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:00,324 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 73 flow. Second operand 3 states and 417 transitions. [2023-08-23 23:10:00,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 172 flow [2023-08-23 23:10:00,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:10:00,327 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 78 flow [2023-08-23 23:10:00,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-23 23:10:00,331 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-23 23:10:00,335 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 78 flow [2023-08-23 23:10:00,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:00,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:00,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:00,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:10:00,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:00,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash -286796732, now seen corresponding path program 1 times [2023-08-23 23:10:00,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817340407] [2023-08-23 23:10:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817340407] [2023-08-23 23:10:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817340407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19743250] [2023-08-23 23:10:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:00,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 246 [2023-08-23 23:10:00,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:00,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:00,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 246 [2023-08-23 23:10:00,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:01,336 INFO L124 PetriNetUnfolderBase]: 2400/3401 cut-off events. [2023-08-23 23:10:01,337 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2023-08-23 23:10:01,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7833 conditions, 3401 events. 2400/3401 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15283 event pairs, 644 based on Foata normal form. 32/3433 useless extension candidates. Maximal degree in co-relation 7820. Up to 2545 conditions per place. [2023-08-23 23:10:01,357 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 38 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-23 23:10:01,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 203 flow [2023-08-23 23:10:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-23 23:10:01,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2023-08-23 23:10:01,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-23 23:10:01,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-23 23:10:01,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:01,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-23 23:10:01,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,362 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 78 flow. Second operand 3 states and 388 transitions. [2023-08-23 23:10:01,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 203 flow [2023-08-23 23:10:01,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:10:01,365 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 82 flow [2023-08-23 23:10:01,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-23 23:10:01,366 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-23 23:10:01,366 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 82 flow [2023-08-23 23:10:01,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:01,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:01,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:10:01,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:01,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2121403934, now seen corresponding path program 1 times [2023-08-23 23:10:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10398568] [2023-08-23 23:10:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10398568] [2023-08-23 23:10:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10398568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:01,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:01,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195187181] [2023-08-23 23:10:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:01,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:10:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:10:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:10:01,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 246 [2023-08-23 23:10:01,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:01,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 246 [2023-08-23 23:10:01,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:01,923 INFO L124 PetriNetUnfolderBase]: 2471/3538 cut-off events. [2023-08-23 23:10:01,923 INFO L125 PetriNetUnfolderBase]: For 1169/1169 co-relation queries the response was YES. [2023-08-23 23:10:01,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 3538 events. 2471/3538 cut-off events. For 1169/1169 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17064 event pairs, 1399 based on Foata normal form. 72/3600 useless extension candidates. Maximal degree in co-relation 8454. Up to 2197 conditions per place. [2023-08-23 23:10:01,939 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-23 23:10:01,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 201 flow [2023-08-23 23:10:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-23 23:10:01,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5663956639566395 [2023-08-23 23:10:01,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-23 23:10:01,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-23 23:10:01,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:01,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-23 23:10:01,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,946 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 82 flow. Second operand 3 states and 418 transitions. [2023-08-23 23:10:01,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 201 flow [2023-08-23 23:10:01,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:10:01,949 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 89 flow [2023-08-23 23:10:01,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-23 23:10:01,950 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-23 23:10:01,951 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 89 flow [2023-08-23 23:10:01,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:01,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:01,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:01,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:10:01,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:01,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2141424570, now seen corresponding path program 1 times [2023-08-23 23:10:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:01,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841266957] [2023-08-23 23:10:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:01,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:03,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:03,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841266957] [2023-08-23 23:10:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841266957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:03,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:03,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:10:03,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597184077] [2023-08-23 23:10:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:03,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:10:03,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:03,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:10:03,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:10:03,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2023-08-23 23:10:03,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 89 flow. Second operand has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:03,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:03,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2023-08-23 23:10:03,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:04,018 INFO L124 PetriNetUnfolderBase]: 2548/3643 cut-off events. [2023-08-23 23:10:04,018 INFO L125 PetriNetUnfolderBase]: For 1776/1824 co-relation queries the response was YES. [2023-08-23 23:10:04,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8826 conditions, 3643 events. 2548/3643 cut-off events. For 1776/1824 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16758 event pairs, 634 based on Foata normal form. 22/3662 useless extension candidates. Maximal degree in co-relation 8812. Up to 3201 conditions per place. [2023-08-23 23:10:04,041 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 32 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-08-23 23:10:04,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 194 flow [2023-08-23 23:10:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:10:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:10:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-23 23:10:04,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45663956639566394 [2023-08-23 23:10:04,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-23 23:10:04,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-23 23:10:04,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:04,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-23 23:10:04,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,046 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 89 flow. Second operand 3 states and 337 transitions. [2023-08-23 23:10:04,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 194 flow [2023-08-23 23:10:04,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 186 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-23 23:10:04,049 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 103 flow [2023-08-23 23:10:04,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-23 23:10:04,050 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-23 23:10:04,050 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 103 flow [2023-08-23 23:10:04,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:04,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:04,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:10:04,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:04,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1959649505, now seen corresponding path program 1 times [2023-08-23 23:10:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983523544] [2023-08-23 23:10:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983523544] [2023-08-23 23:10:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983523544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:10:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14707075] [2023-08-23 23:10:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:04,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-08-23 23:10:04,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 103 flow. Second operand has 4 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-23 23:10:04,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:04,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-08-23 23:10:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:04,884 INFO L124 PetriNetUnfolderBase]: 3065/4366 cut-off events. [2023-08-23 23:10:04,884 INFO L125 PetriNetUnfolderBase]: For 2302/2359 co-relation queries the response was YES. [2023-08-23 23:10:04,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10806 conditions, 4366 events. 3065/4366 cut-off events. For 2302/2359 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20942 event pairs, 2186 based on Foata normal form. 43/4406 useless extension candidates. Maximal degree in co-relation 10790. Up to 3793 conditions per place. [2023-08-23 23:10:04,921 INFO L140 encePairwiseOnDemand]: 237/246 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2023-08-23 23:10:04,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 214 flow [2023-08-23 23:10:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:10:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:10:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-08-23 23:10:04,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152439024390244 [2023-08-23 23:10:04,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-08-23 23:10:04,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-08-23 23:10:04,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:04,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-08-23 23:10:04,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:04,929 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 103 flow. Second operand 4 states and 507 transitions. [2023-08-23 23:10:04,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 214 flow [2023-08-23 23:10:04,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:10:04,971 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 155 flow [2023-08-23 23:10:04,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-23 23:10:04,971 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-08-23 23:10:04,971 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 155 flow [2023-08-23 23:10:04,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-23 23:10:04,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:04,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:04,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:10:04,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:04,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1959546275, now seen corresponding path program 2 times [2023-08-23 23:10:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663103410] [2023-08-23 23:10:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:05,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:05,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663103410] [2023-08-23 23:10:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663103410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:10:05,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214598714] [2023-08-23 23:10:05,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:10:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:05,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:10:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:10:05,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 246 [2023-08-23 23:10:05,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:05,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:05,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 246 [2023-08-23 23:10:05,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:06,251 INFO L124 PetriNetUnfolderBase]: 4289/6161 cut-off events. [2023-08-23 23:10:06,252 INFO L125 PetriNetUnfolderBase]: For 5398/5479 co-relation queries the response was YES. [2023-08-23 23:10:06,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17576 conditions, 6161 events. 4289/6161 cut-off events. For 5398/5479 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 32665 event pairs, 1883 based on Foata normal form. 99/6258 useless extension candidates. Maximal degree in co-relation 17558. Up to 3484 conditions per place. [2023-08-23 23:10:06,281 INFO L140 encePairwiseOnDemand]: 236/246 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2023-08-23 23:10:06,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 328 flow [2023-08-23 23:10:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:10:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:10:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-23 23:10:06,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186991869918699 [2023-08-23 23:10:06,285 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-23 23:10:06,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-23 23:10:06,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:06,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-23 23:10:06,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:06,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:06,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:06,289 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 155 flow. Second operand 5 states and 638 transitions. [2023-08-23 23:10:06,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 328 flow [2023-08-23 23:10:06,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:10:06,295 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 191 flow [2023-08-23 23:10:06,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-23 23:10:06,296 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-23 23:10:06,296 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 191 flow [2023-08-23 23:10:06,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:06,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:06,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:06,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:10:06,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:06,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1957731907, now seen corresponding path program 1 times [2023-08-23 23:10:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647457812] [2023-08-23 23:10:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647457812] [2023-08-23 23:10:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647457812] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:06,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:10:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219378706] [2023-08-23 23:10:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:06,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:10:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:10:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:10:06,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-08-23 23:10:06,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:06,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:06,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-08-23 23:10:06,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:07,383 INFO L124 PetriNetUnfolderBase]: 3912/5813 cut-off events. [2023-08-23 23:10:07,384 INFO L125 PetriNetUnfolderBase]: For 6993/7211 co-relation queries the response was YES. [2023-08-23 23:10:07,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17079 conditions, 5813 events. 3912/5813 cut-off events. For 6993/7211 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 33172 event pairs, 749 based on Foata normal form. 652/6457 useless extension candidates. Maximal degree in co-relation 17060. Up to 4081 conditions per place. [2023-08-23 23:10:07,411 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 50 selfloop transitions, 5 changer transitions 36/95 dead transitions. [2023-08-23 23:10:07,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 656 flow [2023-08-23 23:10:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:10:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:10:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-23 23:10:07,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2023-08-23 23:10:07,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-23 23:10:07,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-23 23:10:07,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:07,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-23 23:10:07,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:07,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:07,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:07,418 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 191 flow. Second operand 5 states and 670 transitions. [2023-08-23 23:10:07,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 656 flow [2023-08-23 23:10:07,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:10:07,426 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 224 flow [2023-08-23 23:10:07,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-23 23:10:07,428 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-23 23:10:07,428 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 224 flow [2023-08-23 23:10:07,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:07,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:07,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:07,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:10:07,429 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:07,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:07,430 INFO L85 PathProgramCache]: Analyzing trace with hash 559984319, now seen corresponding path program 1 times [2023-08-23 23:10:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314854963] [2023-08-23 23:10:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314854963] [2023-08-23 23:10:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314854963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:07,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:10:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089970679] [2023-08-23 23:10:07,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:07,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:10:07,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:07,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:10:07,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:10:07,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-08-23 23:10:07,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:07,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:07,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-08-23 23:10:07,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:08,271 INFO L124 PetriNetUnfolderBase]: 2456/3818 cut-off events. [2023-08-23 23:10:08,271 INFO L125 PetriNetUnfolderBase]: For 6242/6380 co-relation queries the response was YES. [2023-08-23 23:10:08,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14431 conditions, 3818 events. 2456/3818 cut-off events. For 6242/6380 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 21569 event pairs, 277 based on Foata normal form. 489/4299 useless extension candidates. Maximal degree in co-relation 14408. Up to 1707 conditions per place. [2023-08-23 23:10:08,292 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 67 selfloop transitions, 9 changer transitions 38/118 dead transitions. [2023-08-23 23:10:08,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 118 transitions, 856 flow [2023-08-23 23:10:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:10:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:10:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-08-23 23:10:08,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460704607046071 [2023-08-23 23:10:08,295 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-08-23 23:10:08,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-08-23 23:10:08,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:08,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-08-23 23:10:08,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:08,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:08,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:08,302 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 224 flow. Second operand 6 states and 806 transitions. [2023-08-23 23:10:08,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 118 transitions, 856 flow [2023-08-23 23:10:08,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 118 transitions, 847 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 23:10:08,322 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 291 flow [2023-08-23 23:10:08,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-23 23:10:08,323 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-23 23:10:08,323 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 291 flow [2023-08-23 23:10:08,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:08,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:08,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:08,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:10:08,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:08,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1320691524, now seen corresponding path program 1 times [2023-08-23 23:10:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:08,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769908515] [2023-08-23 23:10:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769908515] [2023-08-23 23:10:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769908515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:10:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362736147] [2023-08-23 23:10:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:08,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:10:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:10:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:10:08,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-08-23 23:10:08,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:08,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:08,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-08-23 23:10:08,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:09,015 INFO L124 PetriNetUnfolderBase]: 1487/2376 cut-off events. [2023-08-23 23:10:09,016 INFO L125 PetriNetUnfolderBase]: For 5450/5542 co-relation queries the response was YES. [2023-08-23 23:10:09,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 2376 events. 1487/2376 cut-off events. For 5450/5542 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12718 event pairs, 174 based on Foata normal form. 261/2629 useless extension candidates. Maximal degree in co-relation 10278. Up to 1036 conditions per place. [2023-08-23 23:10:09,028 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 75 selfloop transitions, 13 changer transitions 35/127 dead transitions. [2023-08-23 23:10:09,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 1018 flow [2023-08-23 23:10:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:10:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:10:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-08-23 23:10:09,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458768873403019 [2023-08-23 23:10:09,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-08-23 23:10:09,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-08-23 23:10:09,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:09,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-08-23 23:10:09,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,036 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,036 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 291 flow. Second operand 7 states and 940 transitions. [2023-08-23 23:10:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 1018 flow [2023-08-23 23:10:09,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 127 transitions, 952 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-23 23:10:09,072 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 323 flow [2023-08-23 23:10:09,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-08-23 23:10:09,073 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-23 23:10:09,073 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 323 flow [2023-08-23 23:10:09,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:09,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:09,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:10:09,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:09,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -155137890, now seen corresponding path program 1 times [2023-08-23 23:10:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003410471] [2023-08-23 23:10:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:10:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:10:09,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:10:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003410471] [2023-08-23 23:10:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003410471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:10:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:10:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:10:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142007208] [2023-08-23 23:10:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:10:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:10:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:10:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:10:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:10:09,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 246 [2023-08-23 23:10:09,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:10:09,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 246 [2023-08-23 23:10:09,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:10:09,667 INFO L124 PetriNetUnfolderBase]: 1173/1852 cut-off events. [2023-08-23 23:10:09,668 INFO L125 PetriNetUnfolderBase]: For 3831/3910 co-relation queries the response was YES. [2023-08-23 23:10:09,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7692 conditions, 1852 events. 1173/1852 cut-off events. For 3831/3910 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9487 event pairs, 164 based on Foata normal form. 117/1962 useless extension candidates. Maximal degree in co-relation 7665. Up to 700 conditions per place. [2023-08-23 23:10:09,680 INFO L140 encePairwiseOnDemand]: 239/246 looper letters, 61 selfloop transitions, 17 changer transitions 26/106 dead transitions. [2023-08-23 23:10:09,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 106 transitions, 859 flow [2023-08-23 23:10:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:10:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:10:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1052 transitions. [2023-08-23 23:10:09,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345528455284553 [2023-08-23 23:10:09,684 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1052 transitions. [2023-08-23 23:10:09,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1052 transitions. [2023-08-23 23:10:09,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:10:09,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1052 transitions. [2023-08-23 23:10:09,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.5) internal successors, (1052), 8 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,690 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,690 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 323 flow. Second operand 8 states and 1052 transitions. [2023-08-23 23:10:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 106 transitions, 859 flow [2023-08-23 23:10:09,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 772 flow, removed 27 selfloop flow, removed 7 redundant places. [2023-08-23 23:10:09,730 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 282 flow [2023-08-23 23:10:09,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-23 23:10:09,731 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2023-08-23 23:10:09,731 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 282 flow [2023-08-23 23:10:09,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:10:09,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:10:09,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:09,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:10:09,732 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:10:09,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:10:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1614135467, now seen corresponding path program 1 times [2023-08-23 23:10:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:10:09,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373072678] [2023-08-23 23:10:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:10:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:10:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:10:09,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:10:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:10:09,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:10:09,903 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:10:09,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-23 23:10:09,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-23 23:10:09,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-23 23:10:09,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-23 23:10:09,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-23 23:10:09,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:10:09,908 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:10:09,913 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:10:09,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:10:10,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:10:10 BasicIcfg [2023-08-23 23:10:10,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:10:10,022 INFO L158 Benchmark]: Toolchain (without parser) took 22307.61ms. Allocated memory was 343.9MB in the beginning and 841.0MB in the end (delta: 497.0MB). Free memory was 318.9MB in the beginning and 405.5MB in the end (delta: -86.6MB). Peak memory consumption was 411.0MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,022 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 343.9MB. Free memory is still 320.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:10:10,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.43ms. Allocated memory is still 343.9MB. Free memory was 318.9MB in the beginning and 294.4MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.24ms. Allocated memory is still 343.9MB. Free memory was 294.4MB in the beginning and 291.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,023 INFO L158 Benchmark]: Boogie Preprocessor took 54.70ms. Allocated memory is still 343.9MB. Free memory was 291.2MB in the beginning and 288.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,023 INFO L158 Benchmark]: RCFGBuilder took 967.96ms. Allocated memory is still 343.9MB. Free memory was 288.6MB in the beginning and 271.1MB in the end (delta: 17.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,023 INFO L158 Benchmark]: TraceAbstraction took 20669.89ms. Allocated memory was 343.9MB in the beginning and 841.0MB in the end (delta: 497.0MB). Free memory was 271.1MB in the beginning and 405.5MB in the end (delta: -134.4MB). Peak memory consumption was 361.9MB. Max. memory is 16.0GB. [2023-08-23 23:10:10,024 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.15ms. Allocated memory is still 343.9MB. Free memory is still 320.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 525.43ms. Allocated memory is still 343.9MB. Free memory was 318.9MB in the beginning and 294.4MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 84.24ms. Allocated memory is still 343.9MB. Free memory was 294.4MB in the beginning and 291.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.70ms. Allocated memory is still 343.9MB. Free memory was 291.2MB in the beginning and 288.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 967.96ms. Allocated memory is still 343.9MB. Free memory was 288.6MB in the beginning and 271.1MB in the end (delta: 17.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. * TraceAbstraction took 20669.89ms. Allocated memory was 343.9MB in the beginning and 841.0MB in the end (delta: 497.0MB). Free memory was 271.1MB in the beginning and 405.5MB in the end (delta: -134.4MB). Peak memory consumption was 361.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 136 PlacesBefore, 36 PlacesAfterwards, 124 TransitionsBefore, 23 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 4311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1701, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 877, independent: 838, independent conditional: 0, independent unconditional: 838, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1701, independent: 671, independent conditional: 0, independent unconditional: 671, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 877, unknown conditional: 0, unknown unconditional: 877] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=-3, t2161={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=-2, t2161={7:0}, t2162={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t2163; [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=-1, t2161={7:0}, t2162={5:0}, t2163={6:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t2164; [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=0, t2161={7:0}, t2162={5:0}, t2163={6:0}, t2164={8:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L826] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2161={7:0}, t2162={5:0}, t2163={6:0}, t2164={8:0}, weak$$choice1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] EXPR 0 \read(y) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 854]: 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: 852]: 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: 858]: 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: 856]: 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, 173 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 5 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:10:10,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...