/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:36:50,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:36:50,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:36:50,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:36:50,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:36:50,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:36:50,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:36:50,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:36:50,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:36:51,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:36:51,009 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:36:51,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:36:51,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:36:51,009 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:36:51,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:36:51,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:36:51,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:36:51,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:36:51,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:36:51,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:36:51,012 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:36:51,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:36:51,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:51,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:36:51,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:36:51,013 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:36:51,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:36:51,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:36:51,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:36:51,289 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:36:51,290 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:36:51,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2023-08-24 05:36:52,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:36:52,623 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:36:52,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2023-08-24 05:36:52,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e1a5a5e/e29e77218ece45c4b3aa303a08c7b9de/FLAG666e017f4 [2023-08-24 05:36:52,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e1a5a5e/e29e77218ece45c4b3aa303a08c7b9de [2023-08-24 05:36:52,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:36:52,671 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:36:52,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:52,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:36:52,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:36:52,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:52" (1/1) ... [2023-08-24 05:36:52,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33129da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:52, skipping insertion in model container [2023-08-24 05:36:52,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:36:52" (1/1) ... [2023-08-24 05:36:52,716 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:36:52,843 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/safe027_power.oepc.i[995,1008] [2023-08-24 05:36:53,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:53,009 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:36:53,016 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/safe027_power.oepc.i[995,1008] [2023-08-24 05:36:53,021 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:53,022 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:36:53,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:36:53,068 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:53,068 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:36:53,073 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:36:53,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53 WrapperNode [2023-08-24 05:36:53,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:36:53,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:53,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:36:53,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:36:53,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,103 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2023-08-24 05:36:53,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:36:53,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:36:53,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:36:53,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:36:53,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:36:53,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:36:53,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:36:53,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:36:53,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (1/1) ... [2023-08-24 05:36:53,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:36:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:36:53,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:36:53,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:36:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 05:36:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:36:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:36:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:36:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:36:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 05:36:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 05:36:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:36:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:36:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:36:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:36:53,192 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:36:53,296 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:36:53,297 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:36:53,700 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:36:53,896 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:36:53,896 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:36:53,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:53 BoogieIcfgContainer [2023-08-24 05:36:53,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:36:53,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:36:53,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:36:53,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:36:53,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:36:52" (1/3) ... [2023-08-24 05:36:53,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b888e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:53, skipping insertion in model container [2023-08-24 05:36:53,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:36:53" (2/3) ... [2023-08-24 05:36:53,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b888e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:36:53, skipping insertion in model container [2023-08-24 05:36:53,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:36:53" (3/3) ... [2023-08-24 05:36:53,906 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2023-08-24 05:36:53,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:36:53,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 05:36:53,917 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:36:54,000 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:36:54,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-24 05:36:54,070 INFO L124 PetriNetUnfolderBase]: 2/139 cut-off events. [2023-08-24 05:36:54,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-24 05:36:54,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-24 05:36:54,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2023-08-24 05:36:54,078 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:36:54,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2023-08-24 05:36:54,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2023-08-24 05:36:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2023-08-24 05:36:54,104 INFO L124 PetriNetUnfolderBase]: 1/125 cut-off events. [2023-08-24 05:36:54,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:36:54,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 46 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-24 05:36:54,105 INFO L119 LiptonReduction]: Number of co-enabled transitions 1654 [2023-08-24 05:37:00,430 INFO L134 LiptonReduction]: Checked pairs total: 3511 [2023-08-24 05:37:00,431 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-24 05:37:00,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:37:00,454 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;@6a7f7c26, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:37:00,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:37:00,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:37:00,474 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-08-24 05:37:00,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:37:00,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:00,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:00,475 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-24 05:37:00,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2083198233, now seen corresponding path program 1 times [2023-08-24 05:37:00,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:00,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183234779] [2023-08-24 05:37:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183234779] [2023-08-24 05:37:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183234779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:37:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621819463] [2023-08-24 05:37:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:37:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:37:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:37:00,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 248 [2023-08-24 05:37:00,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:00,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:00,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 248 [2023-08-24 05:37:00,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:01,385 INFO L124 PetriNetUnfolderBase]: 1556/2194 cut-off events. [2023-08-24 05:37:01,386 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-24 05:37:01,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 2194 events. 1556/2194 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9739 event pairs, 314 based on Foata normal form. 36/2229 useless extension candidates. Maximal degree in co-relation 4479. Up to 1801 conditions per place. [2023-08-24 05:37:01,401 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-24 05:37:01,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 145 flow [2023-08-24 05:37:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:37:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:37:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-24 05:37:01,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2023-08-24 05:37:01,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-24 05:37:01,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-24 05:37:01,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:01,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-24 05:37:01,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:01,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:01,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:01,429 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 56 flow. Second operand 3 states and 420 transitions. [2023-08-24 05:37:01,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 145 flow [2023-08-24 05:37:01,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 05:37:01,434 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 60 flow [2023-08-24 05:37:01,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-24 05:37:01,437 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2023-08-24 05:37:01,438 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 60 flow [2023-08-24 05:37:01,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:01,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:01,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:01,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:37:01,439 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-24 05:37:01,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash -154636491, now seen corresponding path program 1 times [2023-08-24 05:37:01,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266934784] [2023-08-24 05:37:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:01,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266934784] [2023-08-24 05:37:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266934784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:01,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:37:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97038081] [2023-08-24 05:37:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:01,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:37:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:37:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:37:01,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 248 [2023-08-24 05:37:01,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:01,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:01,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 248 [2023-08-24 05:37:01,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:02,093 INFO L124 PetriNetUnfolderBase]: 2757/3894 cut-off events. [2023-08-24 05:37:02,094 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2023-08-24 05:37:02,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8403 conditions, 3894 events. 2757/3894 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18155 event pairs, 493 based on Foata normal form. 144/4038 useless extension candidates. Maximal degree in co-relation 8392. Up to 1660 conditions per place. [2023-08-24 05:37:02,104 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 42 selfloop transitions, 3 changer transitions 5/50 dead transitions. [2023-08-24 05:37:02,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 225 flow [2023-08-24 05:37:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:37:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:37:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-24 05:37:02,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604838709677419 [2023-08-24 05:37:02,106 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-24 05:37:02,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-24 05:37:02,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:02,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-24 05:37:02,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,109 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,109 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 60 flow. Second operand 4 states and 556 transitions. [2023-08-24 05:37:02,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 225 flow [2023-08-24 05:37:02,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:02,110 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 70 flow [2023-08-24 05:37:02,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-08-24 05:37:02,111 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-24 05:37:02,111 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 70 flow [2023-08-24 05:37:02,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:02,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:02,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:37:02,112 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-24 05:37:02,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -498800190, now seen corresponding path program 1 times [2023-08-24 05:37:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487448111] [2023-08-24 05:37:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:02,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:02,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487448111] [2023-08-24 05:37:02,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487448111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:02,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:02,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:37:02,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478763326] [2023-08-24 05:37:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:02,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:37:02,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:02,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:37:02,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:37:02,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 248 [2023-08-24 05:37:02,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:02,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 248 [2023-08-24 05:37:02,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:02,459 INFO L124 PetriNetUnfolderBase]: 994/1579 cut-off events. [2023-08-24 05:37:02,459 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2023-08-24 05:37:02,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1579 events. 994/1579 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7464 event pairs, 228 based on Foata normal form. 24/1603 useless extension candidates. Maximal degree in co-relation 3590. Up to 1107 conditions per place. [2023-08-24 05:37:02,465 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 35 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-24 05:37:02,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 190 flow [2023-08-24 05:37:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:37:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:37:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-24 05:37:02,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.571236559139785 [2023-08-24 05:37:02,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-24 05:37:02,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-24 05:37:02,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:02,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-24 05:37:02,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,469 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 70 flow. Second operand 3 states and 425 transitions. [2023-08-24 05:37:02,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 190 flow [2023-08-24 05:37:02,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 173 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-24 05:37:02,471 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 66 flow [2023-08-24 05:37:02,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-08-24 05:37:02,471 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-24 05:37:02,471 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 66 flow [2023-08-24 05:37:02,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:02,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:02,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:02,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:37:02,472 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-24 05:37:02,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1610842748, now seen corresponding path program 1 times [2023-08-24 05:37:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575205250] [2023-08-24 05:37:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:02,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575205250] [2023-08-24 05:37:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575205250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200366967] [2023-08-24 05:37:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:03,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:03,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 248 [2023-08-24 05:37:03,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:03,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:03,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 248 [2023-08-24 05:37:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:03,974 INFO L124 PetriNetUnfolderBase]: 1200/1808 cut-off events. [2023-08-24 05:37:03,974 INFO L125 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2023-08-24 05:37:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4231 conditions, 1808 events. 1200/1808 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8207 event pairs, 191 based on Foata normal form. 12/1820 useless extension candidates. Maximal degree in co-relation 4219. Up to 1051 conditions per place. [2023-08-24 05:37:03,983 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 39 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-24 05:37:03,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 227 flow [2023-08-24 05:37:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:37:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:37:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-24 05:37:03,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4627016129032258 [2023-08-24 05:37:03,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-24 05:37:03,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-24 05:37:03,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:03,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-24 05:37:03,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:03,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:03,988 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:03,988 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 66 flow. Second operand 4 states and 459 transitions. [2023-08-24 05:37:03,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 227 flow [2023-08-24 05:37:03,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:03,989 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 108 flow [2023-08-24 05:37:03,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 05:37:03,990 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-24 05:37:03,990 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 108 flow [2023-08-24 05:37:03,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:03,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:03,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:37:03,991 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-24 05:37:03,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1690455522, now seen corresponding path program 2 times [2023-08-24 05:37:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136165270] [2023-08-24 05:37:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136165270] [2023-08-24 05:37:04,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136165270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:04,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:04,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785201232] [2023-08-24 05:37:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:04,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 248 [2023-08-24 05:37:04,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-24 05:37:04,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:04,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 248 [2023-08-24 05:37:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:05,038 INFO L124 PetriNetUnfolderBase]: 1168/1764 cut-off events. [2023-08-24 05:37:05,039 INFO L125 PetriNetUnfolderBase]: For 661/661 co-relation queries the response was YES. [2023-08-24 05:37:05,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 1764 events. 1168/1764 cut-off events. For 661/661 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8064 event pairs, 127 based on Foata normal form. 12/1775 useless extension candidates. Maximal degree in co-relation 4555. Up to 1039 conditions per place. [2023-08-24 05:37:05,047 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 42 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-24 05:37:05,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 263 flow [2023-08-24 05:37:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:37:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:37:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-24 05:37:05,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-08-24 05:37:05,049 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-24 05:37:05,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-24 05:37:05,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:05,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-24 05:37:05,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,052 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 108 flow. Second operand 4 states and 465 transitions. [2023-08-24 05:37:05,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 263 flow [2023-08-24 05:37:05,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:37:05,055 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 124 flow [2023-08-24 05:37:05,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-24 05:37:05,057 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2023-08-24 05:37:05,057 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 124 flow [2023-08-24 05:37:05,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 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-24 05:37:05,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:05,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:05,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:37:05,058 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-24 05:37:05,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -735637311, now seen corresponding path program 1 times [2023-08-24 05:37:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654107985] [2023-08-24 05:37:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:05,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:05,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654107985] [2023-08-24 05:37:05,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654107985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:05,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:05,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683302671] [2023-08-24 05:37:05,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:05,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:37:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:37:05,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:37:05,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-08-24 05:37:05,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:05,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-08-24 05:37:05,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:05,481 INFO L124 PetriNetUnfolderBase]: 1178/1793 cut-off events. [2023-08-24 05:37:05,482 INFO L125 PetriNetUnfolderBase]: For 1500/1500 co-relation queries the response was YES. [2023-08-24 05:37:05,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 1793 events. 1178/1793 cut-off events. For 1500/1500 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8266 event pairs, 218 based on Foata normal form. 126/1918 useless extension candidates. Maximal degree in co-relation 4943. Up to 1292 conditions per place. [2023-08-24 05:37:05,487 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 43 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2023-08-24 05:37:05,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 476 flow [2023-08-24 05:37:05,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:37:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:37:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-24 05:37:05,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362903225806451 [2023-08-24 05:37:05,489 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-24 05:37:05,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-24 05:37:05,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:05,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-24 05:37:05,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,493 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 124 flow. Second operand 5 states and 665 transitions. [2023-08-24 05:37:05,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 476 flow [2023-08-24 05:37:05,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:37:05,495 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 165 flow [2023-08-24 05:37:05,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-24 05:37:05,497 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2023-08-24 05:37:05,498 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 165 flow [2023-08-24 05:37:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:05,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:37:05,498 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-24 05:37:05,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1792465917, now seen corresponding path program 1 times [2023-08-24 05:37:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522228829] [2023-08-24 05:37:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522228829] [2023-08-24 05:37:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522228829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:37:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110727868] [2023-08-24 05:37:05,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:05,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:37:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:05,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:37:05,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:37:05,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-08-24 05:37:05,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:05,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-08-24 05:37:05,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:05,875 INFO L124 PetriNetUnfolderBase]: 789/1260 cut-off events. [2023-08-24 05:37:05,875 INFO L125 PetriNetUnfolderBase]: For 1619/1619 co-relation queries the response was YES. [2023-08-24 05:37:05,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 1260 events. 789/1260 cut-off events. For 1619/1619 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5674 event pairs, 80 based on Foata normal form. 98/1357 useless extension candidates. Maximal degree in co-relation 4549. Up to 570 conditions per place. [2023-08-24 05:37:05,882 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 58 selfloop transitions, 9 changer transitions 27/95 dead transitions. [2023-08-24 05:37:05,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 667 flow [2023-08-24 05:37:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:37:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:37:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-24 05:37:05,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-24 05:37:05,884 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-24 05:37:05,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-24 05:37:05,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:05,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-24 05:37:05,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,888 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 165 flow. Second operand 6 states and 800 transitions. [2023-08-24 05:37:05,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 667 flow [2023-08-24 05:37:05,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 95 transitions, 660 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:05,894 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 230 flow [2023-08-24 05:37:05,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-24 05:37:05,896 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-08-24 05:37:05,896 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 230 flow [2023-08-24 05:37:05,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:05,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:05,897 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-24 05:37:05,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:37:05,897 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-24 05:37:05,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -131050548, now seen corresponding path program 1 times [2023-08-24 05:37:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70561402] [2023-08-24 05:37:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70561402] [2023-08-24 05:37:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70561402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:06,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:06,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585753053] [2023-08-24 05:37:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:37:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:06,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:37:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:37:06,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 248 [2023-08-24 05:37:06,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:06,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 248 [2023-08-24 05:37:06,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:06,283 INFO L124 PetriNetUnfolderBase]: 1227/1960 cut-off events. [2023-08-24 05:37:06,283 INFO L125 PetriNetUnfolderBase]: For 4628/4628 co-relation queries the response was YES. [2023-08-24 05:37:06,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8136 conditions, 1960 events. 1227/1960 cut-off events. For 4628/4628 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9235 event pairs, 193 based on Foata normal form. 20/1980 useless extension candidates. Maximal degree in co-relation 8113. Up to 1128 conditions per place. [2023-08-24 05:37:06,297 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 59 selfloop transitions, 2 changer transitions 19/80 dead transitions. [2023-08-24 05:37:06,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 666 flow [2023-08-24 05:37:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:37:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:37:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-24 05:37:06,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5574596774193549 [2023-08-24 05:37:06,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-24 05:37:06,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-24 05:37:06,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:06,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-24 05:37:06,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,303 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 230 flow. Second operand 4 states and 553 transitions. [2023-08-24 05:37:06,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 666 flow [2023-08-24 05:37:06,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 576 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-24 05:37:06,317 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 205 flow [2023-08-24 05:37:06,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-24 05:37:06,318 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-08-24 05:37:06,319 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 205 flow [2023-08-24 05:37:06,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:06,319 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-24 05:37:06,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:37:06,319 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-24 05:37:06,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1443999704, now seen corresponding path program 2 times [2023-08-24 05:37:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:06,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272703598] [2023-08-24 05:37:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:06,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:06,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272703598] [2023-08-24 05:37:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272703598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:06,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625388661] [2023-08-24 05:37:06,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:06,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:37:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:37:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:37:06,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-08-24 05:37:06,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:06,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-08-24 05:37:06,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:06,711 INFO L124 PetriNetUnfolderBase]: 846/1404 cut-off events. [2023-08-24 05:37:06,712 INFO L125 PetriNetUnfolderBase]: For 2077/2097 co-relation queries the response was YES. [2023-08-24 05:37:06,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1404 events. 846/1404 cut-off events. For 2077/2097 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6783 event pairs, 69 based on Foata normal form. 99/1489 useless extension candidates. Maximal degree in co-relation 5121. Up to 483 conditions per place. [2023-08-24 05:37:06,721 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 67 selfloop transitions, 13 changer transitions 24/106 dead transitions. [2023-08-24 05:37:06,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 783 flow [2023-08-24 05:37:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:37:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:37:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions. [2023-08-24 05:37:06,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362903225806451 [2023-08-24 05:37:06,723 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 931 transitions. [2023-08-24 05:37:06,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions. [2023-08-24 05:37:06,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:06,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions. [2023-08-24 05:37:06,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,727 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,727 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 205 flow. Second operand 7 states and 931 transitions. [2023-08-24 05:37:06,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 783 flow [2023-08-24 05:37:06,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:37:06,732 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 292 flow [2023-08-24 05:37:06,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-24 05:37:06,733 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-08-24 05:37:06,733 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 292 flow [2023-08-24 05:37:06,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:06,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:06,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:37:06,733 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-24 05:37:06,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash 397611165, now seen corresponding path program 1 times [2023-08-24 05:37:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:06,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580541117] [2023-08-24 05:37:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:06,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580541117] [2023-08-24 05:37:06,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580541117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:06,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:37:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904414595] [2023-08-24 05:37:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:06,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:06,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-08-24 05:37:06,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:06,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:06,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-08-24 05:37:06,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:07,184 INFO L124 PetriNetUnfolderBase]: 698/1147 cut-off events. [2023-08-24 05:37:07,185 INFO L125 PetriNetUnfolderBase]: For 2496/2516 co-relation queries the response was YES. [2023-08-24 05:37:07,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 1147 events. 698/1147 cut-off events. For 2496/2516 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5422 event pairs, 64 based on Foata normal form. 37/1170 useless extension candidates. Maximal degree in co-relation 4717. Up to 443 conditions per place. [2023-08-24 05:37:07,191 INFO L140 encePairwiseOnDemand]: 241/248 looper letters, 57 selfloop transitions, 17 changer transitions 18/93 dead transitions. [2023-08-24 05:37:07,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 750 flow [2023-08-24 05:37:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:37:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:37:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2023-08-24 05:37:07,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252016129032258 [2023-08-24 05:37:07,193 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2023-08-24 05:37:07,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2023-08-24 05:37:07,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:07,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2023-08-24 05:37:07,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:07,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:07,198 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:07,198 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 292 flow. Second operand 8 states and 1042 transitions. [2023-08-24 05:37:07,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 750 flow [2023-08-24 05:37:07,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 652 flow, removed 26 selfloop flow, removed 8 redundant places. [2023-08-24 05:37:07,210 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 264 flow [2023-08-24 05:37:07,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2023-08-24 05:37:07,211 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-08-24 05:37:07,211 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 264 flow [2023-08-24 05:37:07,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:07,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:07,212 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] [2023-08-24 05:37:07,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:37:07,212 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-24 05:37:07,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 899489893, now seen corresponding path program 1 times [2023-08-24 05:37:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855721687] [2023-08-24 05:37:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:07,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:37:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:07,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:37:07,330 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:37:07,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:37:07,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-24 05:37:07,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:37:07,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:37:07,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-24 05:37:07,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:37:07,332 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:07,335 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:37:07,335 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:37:07,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:37:07 BasicIcfg [2023-08-24 05:37:07,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:37:07,421 INFO L158 Benchmark]: Toolchain (without parser) took 14749.91ms. Allocated memory was 325.1MB in the beginning and 851.4MB in the end (delta: 526.4MB). Free memory was 299.7MB in the beginning and 577.5MB in the end (delta: -277.8MB). Peak memory consumption was 250.5MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,421 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 325.1MB. Free memory is still 301.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:37:07,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 325.1MB. Free memory was 299.7MB in the beginning and 274.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 325.1MB. Free memory was 274.5MB in the beginning and 272.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,422 INFO L158 Benchmark]: Boogie Preprocessor took 27.43ms. Allocated memory is still 325.1MB. Free memory was 272.0MB in the beginning and 269.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,422 INFO L158 Benchmark]: RCFGBuilder took 766.41ms. Allocated memory is still 325.1MB. Free memory was 269.4MB in the beginning and 239.7MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,422 INFO L158 Benchmark]: TraceAbstraction took 13520.83ms. Allocated memory was 325.1MB in the beginning and 851.4MB in the end (delta: 526.4MB). Free memory was 238.7MB in the beginning and 577.5MB in the end (delta: -338.8MB). Peak memory consumption was 187.5MB. Max. memory is 16.0GB. [2023-08-24 05:37:07,423 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.17ms. Allocated memory is still 325.1MB. Free memory is still 301.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 400.49ms. Allocated memory is still 325.1MB. Free memory was 299.7MB in the beginning and 274.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 325.1MB. Free memory was 274.5MB in the beginning and 272.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.43ms. Allocated memory is still 325.1MB. Free memory was 272.0MB in the beginning and 269.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 766.41ms. Allocated memory is still 325.1MB. Free memory was 269.4MB in the beginning and 239.7MB in the end (delta: 29.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 13520.83ms. Allocated memory was 325.1MB in the beginning and 851.4MB in the end (delta: 526.4MB). Free memory was 238.7MB in the beginning and 577.5MB in the end (delta: -338.8MB). Peak memory consumption was 187.5MB. 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: 6.3s, 137 PlacesBefore, 35 PlacesAfterwards, 125 TransitionsBefore, 22 TransitionsAfterwards, 1654 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 3511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1580, independent: 1426, independent conditional: 0, independent unconditional: 1426, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 854, independent: 812, independent conditional: 0, independent unconditional: 812, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1580, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 854, unknown conditional: 0, unknown unconditional: 854] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=-3, t2417={6: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}] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((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=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=-2, t2417={6:0}, t2418={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}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((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=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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=-1, t2417={6:0}, t2418={7:0}, t2419={8: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}] [L870] 0 pthread_t t2420; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = 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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L871] FCALL, FORK 0 pthread_create(&t2420, ((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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=0, t2417={6:0}, t2418={7:0}, t2419={8:0}, t2420={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, 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}] [L839] 4 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, 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}] [L842] 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) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, 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}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] 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) [L877] 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) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 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 [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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, t2417={6:0}, t2418={7:0}, t2419={8:0}, t2420={5:0}, weak$$choice1=1, 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}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=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}] - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 867]: 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: 13.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 848 IncrementalHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 1 mSDtfsCounter, 848 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=9, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 1074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:37:07,447 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...