/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:55:43,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:55:43,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 22:55:43,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:55:43,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:55:43,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:55:43,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:55:43,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:55:43,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:55:43,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:55:43,187 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:55:43,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:55:43,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:55:43,188 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:55:43,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:55:43,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:55:43,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:55:43,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:55:43,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:55:43,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:55:43,190 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:55:43,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:55:43,194 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:55:43,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:55:43,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:55:43,198 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:55:43,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:55:43,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:55:43,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:55:43,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:55:43,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:55:43,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:55:43,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:55:43,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:55:43,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:55:43,201 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 22:55:43,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:55:43,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:55:43,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:55:43,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:55:43,524 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:55:43,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2023-08-23 22:55:44,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:55:44,966 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:55:44,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2023-08-23 22:55:44,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dd5059b/042995f7053f4371a1b3eb819d6699c2/FLAGced3ecf14 [2023-08-23 22:55:45,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dd5059b/042995f7053f4371a1b3eb819d6699c2 [2023-08-23 22:55:45,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:55:45,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:55:45,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:55:45,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:55:45,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:55:45,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452382e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45, skipping insertion in model container [2023-08-23 22:55:45,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:55:45,180 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/mix002.oepc.i[945,958] [2023-08-23 22:55:45,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:55:45,359 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:55:45,370 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/mix002.oepc.i[945,958] [2023-08-23 22:55:45,390 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:55:45,391 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:55:45,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:55:45,469 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:55:45,470 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:55:45,475 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:55:45,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45 WrapperNode [2023-08-23 22:55:45,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:55:45,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:55:45,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:55:45,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:55:45,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,525 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-08-23 22:55:45,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:55:45,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:55:45,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:55:45,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:55:45,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:55:45,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:55:45,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:55:45,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:55:45,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (1/1) ... [2023-08-23 22:55:45,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:55:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:55:45,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 22:55:45,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 22:55:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:55:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 22:55:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:55:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:55:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:55:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 22:55:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 22:55:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 22:55:45,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 22:55:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 22:55:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 22:55:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:55:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 22:55:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:55:45,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:55:45,641 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:55:45,798 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:55:45,800 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:55:46,101 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:55:46,191 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:55:46,191 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 22:55:46,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:55:46 BoogieIcfgContainer [2023-08-23 22:55:46,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:55:46,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:55:46,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:55:46,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:55:46,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:55:45" (1/3) ... [2023-08-23 22:55:46,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b44d5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:55:46, skipping insertion in model container [2023-08-23 22:55:46,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:55:45" (2/3) ... [2023-08-23 22:55:46,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b44d5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:55:46, skipping insertion in model container [2023-08-23 22:55:46,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:55:46" (3/3) ... [2023-08-23 22:55:46,199 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2023-08-23 22:55:46,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:55:46,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:55:46,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:55:46,254 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 22:55:46,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-23 22:55:46,319 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-08-23 22:55:46,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:55:46,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-23 22:55:46,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-23 22:55:46,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-23 22:55:46,330 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:55:46,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-23 22:55:46,340 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-23 22:55:46,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-23 22:55:46,364 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-08-23 22:55:46,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:55:46,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-23 22:55:46,367 INFO L119 LiptonReduction]: Number of co-enabled transitions 2348 [2023-08-23 22:55:49,812 INFO L134 LiptonReduction]: Checked pairs total: 7155 [2023-08-23 22:55:49,812 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-23 22:55:49,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:55:49,828 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;@67ce752d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:55:49,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 22:55:49,831 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:55:49,831 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-23 22:55:49,831 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:55:49,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:49,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 22:55:49,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:49,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 495443, now seen corresponding path program 1 times [2023-08-23 22:55:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:49,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907486788] [2023-08-23 22:55:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:50,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907486788] [2023-08-23 22:55:50,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907486788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:55:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047719345] [2023-08-23 22:55:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:50,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:55:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:50,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:55:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:55:50,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 213 [2023-08-23 22:55:50,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:50,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 213 [2023-08-23 22:55:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:50,653 INFO L124 PetriNetUnfolderBase]: 1616/2528 cut-off events. [2023-08-23 22:55:50,653 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-23 22:55:50,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4952 conditions, 2528 events. 1616/2528 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 14570 event pairs, 204 based on Foata normal form. 100/2421 useless extension candidates. Maximal degree in co-relation 4941. Up to 2013 conditions per place. [2023-08-23 22:55:50,668 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 34 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-23 22:55:50,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 183 flow [2023-08-23 22:55:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:55:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:55:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-23 22:55:50,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508607198748043 [2023-08-23 22:55:50,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-23 22:55:50,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-23 22:55:50,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:50,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-23 22:55:50,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,704 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 352 transitions. [2023-08-23 22:55:50,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 183 flow [2023-08-23 22:55:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 22:55:50,708 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 60 flow [2023-08-23 22:55:50,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-23 22:55:50,713 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2023-08-23 22:55:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 60 flow [2023-08-23 22:55:50,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:50,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:55:50,714 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:50,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1441248496, now seen corresponding path program 1 times [2023-08-23 22:55:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:50,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652998677] [2023-08-23 22:55:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:50,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652998677] [2023-08-23 22:55:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652998677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:50,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:55:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120533893] [2023-08-23 22:55:50,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:50,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:55:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:55:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:55:50,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 213 [2023-08-23 22:55:50,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:50,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:50,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 213 [2023-08-23 22:55:50,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:51,506 INFO L124 PetriNetUnfolderBase]: 2899/4264 cut-off events. [2023-08-23 22:55:51,506 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2023-08-23 22:55:51,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8840 conditions, 4264 events. 2899/4264 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 19825 event pairs, 1559 based on Foata normal form. 216/4480 useless extension candidates. Maximal degree in co-relation 8830. Up to 3641 conditions per place. [2023-08-23 22:55:51,525 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 33 selfloop transitions, 4 changer transitions 22/59 dead transitions. [2023-08-23 22:55:51,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 256 flow [2023-08-23 22:55:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-23 22:55:51,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704225352112676 [2023-08-23 22:55:51,528 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-23 22:55:51,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-23 22:55:51,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:51,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-23 22:55:51,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:51,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:51,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:51,533 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 60 flow. Second operand 5 states and 501 transitions. [2023-08-23 22:55:51,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 256 flow [2023-08-23 22:55:51,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:55:51,535 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 92 flow [2023-08-23 22:55:51,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-23 22:55:51,536 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-23 22:55:51,536 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 92 flow [2023-08-23 22:55:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:51,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:51,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:55:51,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:51,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 351376297, now seen corresponding path program 1 times [2023-08-23 22:55:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322481739] [2023-08-23 22:55:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322481739] [2023-08-23 22:55:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322481739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:55:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491500351] [2023-08-23 22:55:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:51,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:55:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:51,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:55:51,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:55:51,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 213 [2023-08-23 22:55:51,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 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-23 22:55:51,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:51,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 213 [2023-08-23 22:55:51,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:52,055 INFO L124 PetriNetUnfolderBase]: 1570/2472 cut-off events. [2023-08-23 22:55:52,056 INFO L125 PetriNetUnfolderBase]: For 1172/1196 co-relation queries the response was YES. [2023-08-23 22:55:52,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5890 conditions, 2472 events. 1570/2472 cut-off events. For 1172/1196 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12740 event pairs, 529 based on Foata normal form. 130/2561 useless extension candidates. Maximal degree in co-relation 5877. Up to 1457 conditions per place. [2023-08-23 22:55:52,070 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 33 selfloop transitions, 3 changer transitions 21/61 dead transitions. [2023-08-23 22:55:52,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 292 flow [2023-08-23 22:55:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-23 22:55:52,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089201877934272 [2023-08-23 22:55:52,072 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-23 22:55:52,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-23 22:55:52,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:52,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-23 22:55:52,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,077 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,077 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 92 flow. Second operand 5 states and 542 transitions. [2023-08-23 22:55:52,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 292 flow [2023-08-23 22:55:52,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:55:52,083 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 101 flow [2023-08-23 22:55:52,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-23 22:55:52,084 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-23 22:55:52,084 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 101 flow [2023-08-23 22:55:52,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 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-23 22:55:52,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:52,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:52,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:55:52,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:52,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 860744071, now seen corresponding path program 1 times [2023-08-23 22:55:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973993215] [2023-08-23 22:55:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973993215] [2023-08-23 22:55:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973993215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:55:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806381432] [2023-08-23 22:55:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:52,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:55:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:55:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:55:52,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 213 [2023-08-23 22:55:52,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:52,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 213 [2023-08-23 22:55:52,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:52,609 INFO L124 PetriNetUnfolderBase]: 2235/3304 cut-off events. [2023-08-23 22:55:52,609 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-23 22:55:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8334 conditions, 3304 events. 2235/3304 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14434 event pairs, 639 based on Foata normal form. 144/3448 useless extension candidates. Maximal degree in co-relation 8318. Up to 2081 conditions per place. [2023-08-23 22:55:52,628 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 37 selfloop transitions, 3 changer transitions 22/62 dead transitions. [2023-08-23 22:55:52,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2023-08-23 22:55:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-23 22:55:52,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704225352112676 [2023-08-23 22:55:52,630 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-23 22:55:52,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-23 22:55:52,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:52,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-23 22:55:52,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,634 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 101 flow. Second operand 5 states and 501 transitions. [2023-08-23 22:55:52,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2023-08-23 22:55:52,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 308 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 22:55:52,644 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 106 flow [2023-08-23 22:55:52,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-23 22:55:52,644 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-23 22:55:52,645 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 106 flow [2023-08-23 22:55:52,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:52,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:52,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:55:52,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:52,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1026202126, now seen corresponding path program 1 times [2023-08-23 22:55:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:52,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371695497] [2023-08-23 22:55:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371695497] [2023-08-23 22:55:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371695497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:55:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803256037] [2023-08-23 22:55:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:55:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:55:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:55:52,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 213 [2023-08-23 22:55:52,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 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-23 22:55:52,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:52,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 213 [2023-08-23 22:55:52,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:53,009 INFO L124 PetriNetUnfolderBase]: 1058/1685 cut-off events. [2023-08-23 22:55:53,010 INFO L125 PetriNetUnfolderBase]: For 1093/1119 co-relation queries the response was YES. [2023-08-23 22:55:53,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 1685 events. 1058/1685 cut-off events. For 1093/1119 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8130 event pairs, 579 based on Foata normal form. 61/1711 useless extension candidates. Maximal degree in co-relation 3985. Up to 1032 conditions per place. [2023-08-23 22:55:53,018 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 32 selfloop transitions, 3 changer transitions 15/56 dead transitions. [2023-08-23 22:55:53,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 276 flow [2023-08-23 22:55:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2023-08-23 22:55:53,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032863849765258 [2023-08-23 22:55:53,020 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2023-08-23 22:55:53,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2023-08-23 22:55:53,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:53,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2023-08-23 22:55:53,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,024 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 106 flow. Second operand 5 states and 536 transitions. [2023-08-23 22:55:53,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 276 flow [2023-08-23 22:55:53,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 266 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 22:55:53,027 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 111 flow [2023-08-23 22:55:53,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-23 22:55:53,028 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-23 22:55:53,028 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 111 flow [2023-08-23 22:55:53,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 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-23 22:55:53,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:53,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:53,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:55:53,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:53,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -845948307, now seen corresponding path program 1 times [2023-08-23 22:55:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172164752] [2023-08-23 22:55:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172164752] [2023-08-23 22:55:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172164752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 22:55:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465698073] [2023-08-23 22:55:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:55:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:55:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:55:53,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 213 [2023-08-23 22:55:53,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:53,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 213 [2023-08-23 22:55:53,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:53,261 INFO L124 PetriNetUnfolderBase]: 559/949 cut-off events. [2023-08-23 22:55:53,261 INFO L125 PetriNetUnfolderBase]: For 657/679 co-relation queries the response was YES. [2023-08-23 22:55:53,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 949 events. 559/949 cut-off events. For 657/679 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4422 event pairs, 149 based on Foata normal form. 62/990 useless extension candidates. Maximal degree in co-relation 2407. Up to 694 conditions per place. [2023-08-23 22:55:53,266 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-23 22:55:53,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 226 flow [2023-08-23 22:55:53,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:55:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:55:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-23 22:55:53,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5226917057902973 [2023-08-23 22:55:53,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-23 22:55:53,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-23 22:55:53,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:53,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-23 22:55:53,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,271 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 111 flow. Second operand 3 states and 334 transitions. [2023-08-23 22:55:53,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 226 flow [2023-08-23 22:55:53,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 212 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-23 22:55:53,273 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 125 flow [2023-08-23 22:55:53,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-23 22:55:53,274 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-23 22:55:53,274 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 125 flow [2023-08-23 22:55:53,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:53,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:53,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:55:53,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:53,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1807720365, now seen corresponding path program 1 times [2023-08-23 22:55:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22261746] [2023-08-23 22:55:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22261746] [2023-08-23 22:55:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22261746] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:53,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:55:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504484850] [2023-08-23 22:55:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:55:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:55:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:55:53,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 213 [2023-08-23 22:55:53,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:53,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 213 [2023-08-23 22:55:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:53,529 INFO L124 PetriNetUnfolderBase]: 295/551 cut-off events. [2023-08-23 22:55:53,530 INFO L125 PetriNetUnfolderBase]: For 229/236 co-relation queries the response was YES. [2023-08-23 22:55:53,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 551 events. 295/551 cut-off events. For 229/236 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2404 event pairs, 104 based on Foata normal form. 51/585 useless extension candidates. Maximal degree in co-relation 1538. Up to 218 conditions per place. [2023-08-23 22:55:53,533 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-23 22:55:53,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 297 flow [2023-08-23 22:55:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 22:55:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 22:55:53,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-23 22:55:53,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234741784037559 [2023-08-23 22:55:53,535 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-23 22:55:53,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-23 22:55:53,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:53,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-23 22:55:53,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,538 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 125 flow. Second operand 4 states and 446 transitions. [2023-08-23 22:55:53,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 297 flow [2023-08-23 22:55:53,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 283 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-23 22:55:53,540 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 155 flow [2023-08-23 22:55:53,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-23 22:55:53,544 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-23 22:55:53,545 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 155 flow [2023-08-23 22:55:53,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:53,545 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-23 22:55:53,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:55:53,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:53,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash 859917476, now seen corresponding path program 1 times [2023-08-23 22:55:53,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:53,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084901340] [2023-08-23 22:55:53,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:53,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084901340] [2023-08-23 22:55:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084901340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:53,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:53,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:55:53,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127648074] [2023-08-23 22:55:53,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:53,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:55:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:55:53,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:55:53,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 213 [2023-08-23 22:55:53,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:53,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 213 [2023-08-23 22:55:53,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:53,935 INFO L124 PetriNetUnfolderBase]: 516/925 cut-off events. [2023-08-23 22:55:53,936 INFO L125 PetriNetUnfolderBase]: For 856/857 co-relation queries the response was YES. [2023-08-23 22:55:53,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 925 events. 516/925 cut-off events. For 856/857 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4257 event pairs, 109 based on Foata normal form. 8/922 useless extension candidates. Maximal degree in co-relation 2725. Up to 425 conditions per place. [2023-08-23 22:55:53,940 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 45 selfloop transitions, 2 changer transitions 24/74 dead transitions. [2023-08-23 22:55:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 479 flow [2023-08-23 22:55:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2023-08-23 22:55:53,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49295774647887325 [2023-08-23 22:55:53,942 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2023-08-23 22:55:53,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2023-08-23 22:55:53,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:53,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2023-08-23 22:55:53,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,945 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 155 flow. Second operand 5 states and 525 transitions. [2023-08-23 22:55:53,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 479 flow [2023-08-23 22:55:53,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 74 transitions, 445 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-23 22:55:53,948 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 156 flow [2023-08-23 22:55:53,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-23 22:55:53,948 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-23 22:55:53,949 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 156 flow [2023-08-23 22:55:53,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:53,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:53,949 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-23 22:55:53,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 22:55:53,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:53,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -560140578, now seen corresponding path program 2 times [2023-08-23 22:55:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:53,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12694090] [2023-08-23 22:55:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12694090] [2023-08-23 22:55:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12694090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:55:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512253817] [2023-08-23 22:55:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:54,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:55:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:55:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:55:54,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 213 [2023-08-23 22:55:54,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:54,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:54,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 213 [2023-08-23 22:55:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:54,280 INFO L124 PetriNetUnfolderBase]: 340/632 cut-off events. [2023-08-23 22:55:54,281 INFO L125 PetriNetUnfolderBase]: For 375/385 co-relation queries the response was YES. [2023-08-23 22:55:54,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1767 conditions, 632 events. 340/632 cut-off events. For 375/385 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3014 event pairs, 118 based on Foata normal form. 24/631 useless extension candidates. Maximal degree in co-relation 1752. Up to 272 conditions per place. [2023-08-23 22:55:54,284 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 39 selfloop transitions, 10 changer transitions 3/57 dead transitions. [2023-08-23 22:55:54,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 318 flow [2023-08-23 22:55:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:55:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:55:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-23 22:55:54,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117370892018779 [2023-08-23 22:55:54,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-23 22:55:54,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-23 22:55:54,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:54,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-23 22:55:54,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:54,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:54,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:54,290 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 156 flow. Second operand 5 states and 545 transitions. [2023-08-23 22:55:54,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 318 flow [2023-08-23 22:55:54,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 294 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-23 22:55:54,292 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 154 flow [2023-08-23 22:55:54,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-23 22:55:54,292 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2023-08-23 22:55:54,293 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 154 flow [2023-08-23 22:55:54,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:54,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:54,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:54,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 22:55:54,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:54,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash -824177124, now seen corresponding path program 1 times [2023-08-23 22:55:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795517405] [2023-08-23 22:55:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795517405] [2023-08-23 22:55:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795517405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 22:55:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191944414] [2023-08-23 22:55:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 22:55:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 22:55:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-23 22:55:55,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 213 [2023-08-23 22:55:55,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 154 flow. Second operand has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:55,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 213 [2023-08-23 22:55:55,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:55,527 INFO L124 PetriNetUnfolderBase]: 256/507 cut-off events. [2023-08-23 22:55:55,527 INFO L125 PetriNetUnfolderBase]: For 532/541 co-relation queries the response was YES. [2023-08-23 22:55:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 507 events. 256/507 cut-off events. For 532/541 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2303 event pairs, 22 based on Foata normal form. 6/505 useless extension candidates. Maximal degree in co-relation 1496. Up to 180 conditions per place. [2023-08-23 22:55:55,534 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 44 selfloop transitions, 3 changer transitions 22/74 dead transitions. [2023-08-23 22:55:55,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 492 flow [2023-08-23 22:55:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:55:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:55:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 683 transitions. [2023-08-23 22:55:55,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4580818242790074 [2023-08-23 22:55:55,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 683 transitions. [2023-08-23 22:55:55,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 683 transitions. [2023-08-23 22:55:55,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:55,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 683 transitions. [2023-08-23 22:55:55,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.57142857142857) internal successors, (683), 7 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,542 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 154 flow. Second operand 7 states and 683 transitions. [2023-08-23 22:55:55,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 492 flow [2023-08-23 22:55:55,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 426 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-23 22:55:55,546 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 139 flow [2023-08-23 22:55:55,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-08-23 22:55:55,548 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2023-08-23 22:55:55,548 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 139 flow [2023-08-23 22:55:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.625) internal successors, (741), 8 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:55,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:55,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 22:55:55,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:55,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1348469192, now seen corresponding path program 2 times [2023-08-23 22:55:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527526363] [2023-08-23 22:55:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:55:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:55:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:55:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527526363] [2023-08-23 22:55:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527526363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:55:55,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:55:55,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:55:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402717629] [2023-08-23 22:55:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:55:55,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:55:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:55:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:55:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:55:55,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 213 [2023-08-23 22:55:55,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:55,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:55:55,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 213 [2023-08-23 22:55:55,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:55:56,029 INFO L124 PetriNetUnfolderBase]: 517/929 cut-off events. [2023-08-23 22:55:56,029 INFO L125 PetriNetUnfolderBase]: For 743/743 co-relation queries the response was YES. [2023-08-23 22:55:56,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 929 events. 517/929 cut-off events. For 743/743 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4314 event pairs, 75 based on Foata normal form. 1/930 useless extension candidates. Maximal degree in co-relation 2783. Up to 524 conditions per place. [2023-08-23 22:55:56,033 INFO L140 encePairwiseOnDemand]: 206/213 looper letters, 34 selfloop transitions, 3 changer transitions 42/79 dead transitions. [2023-08-23 22:55:56,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 485 flow [2023-08-23 22:55:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:55:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:55:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-08-23 22:55:56,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802146210596916 [2023-08-23 22:55:56,035 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-08-23 22:55:56,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-08-23 22:55:56,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:55:56,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-08-23 22:55:56,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:56,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:56,040 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:56,040 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 139 flow. Second operand 7 states and 668 transitions. [2023-08-23 22:55:56,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 485 flow [2023-08-23 22:55:56,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 468 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-23 22:55:56,045 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 135 flow [2023-08-23 22:55:56,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2023-08-23 22:55:56,046 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-08-23 22:55:56,046 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 135 flow [2023-08-23 22:55:56,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:55:56,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:55:56,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:56,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 22:55:56,046 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 22:55:56,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:55:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1549112508, now seen corresponding path program 3 times [2023-08-23 22:55:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:55:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455672344] [2023-08-23 22:55:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:55:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:55:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:55:56,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 22:55:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:55:56,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 22:55:56,171 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 22:55:56,172 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 22:55:56,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 22:55:56,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 22:55:56,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 22:55:56,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 22:55:56,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 22:55:56,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 22:55:56,174 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:55:56,178 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:55:56,178 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:55:56,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:55:56 BasicIcfg [2023-08-23 22:55:56,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:55:56,266 INFO L158 Benchmark]: Toolchain (without parser) took 11258.07ms. Allocated memory was 394.3MB in the beginning and 755.0MB in the end (delta: 360.7MB). Free memory was 369.2MB in the beginning and 376.4MB in the end (delta: -7.2MB). Peak memory consumption was 355.0MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,266 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 394.3MB. Free memory is still 370.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:55:56,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.42ms. Allocated memory is still 394.3MB. Free memory was 369.2MB in the beginning and 345.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.61ms. Allocated memory is still 394.3MB. Free memory was 345.3MB in the beginning and 343.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,267 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 394.3MB. Free memory was 343.1MB in the beginning and 341.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,267 INFO L158 Benchmark]: RCFGBuilder took 632.14ms. Allocated memory is still 394.3MB. Free memory was 341.0MB in the beginning and 347.8MB in the end (delta: -6.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,267 INFO L158 Benchmark]: TraceAbstraction took 10071.03ms. Allocated memory was 394.3MB in the beginning and 755.0MB in the end (delta: 360.7MB). Free memory was 347.0MB in the beginning and 376.4MB in the end (delta: -29.4MB). Peak memory consumption was 331.9MB. Max. memory is 16.0GB. [2023-08-23 22:55:56,268 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 394.3MB. Free memory is still 370.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 467.42ms. Allocated memory is still 394.3MB. Free memory was 369.2MB in the beginning and 345.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.61ms. Allocated memory is still 394.3MB. Free memory was 345.3MB in the beginning and 343.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 394.3MB. Free memory was 343.1MB in the beginning and 341.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 632.14ms. Allocated memory is still 394.3MB. Free memory was 341.0MB in the beginning and 347.8MB in the end (delta: -6.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 10071.03ms. Allocated memory was 394.3MB in the beginning and 755.0MB in the end (delta: 360.7MB). Free memory was 347.0MB in the beginning and 376.4MB in the end (delta: -29.4MB). Peak memory consumption was 331.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 122 PlacesBefore, 38 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2348 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 7155 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3195, independent: 2962, independent conditional: 0, independent unconditional: 2962, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1274, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3195, independent: 1726, independent conditional: 0, independent unconditional: 1726, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 1274, unknown conditional: 0, unknown unconditional: 1274] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-1, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L814] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: 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 7 procedures, 148 locations, 6 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: 9.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 24 mSDtfsCounter, 1100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=8, InterpolantAutomatonStates: 54, 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.4s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 1047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 22:55:56,290 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...