/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/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:11:40,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:11:40,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 23:11:40,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:11:40,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:11:40,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:11:40,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:11:40,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:11:40,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:11:40,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:11:40,624 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:11:40,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:11:40,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:11:40,625 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:11:40,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:11:40,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:11:40,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:11:40,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:11:40,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:11:40,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:11:40,627 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:11:40,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:11:40,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:11:40,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:11:40,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:11:40,636 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:11:40,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:11:40,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:40,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:11:40,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:11:40,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:11:40,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:11:40,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:11:40,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:11:40,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:11:40,640 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 23:11:40,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:11:41,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:11:41,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:11:41,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:11:41,014 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:11:41,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:11:42,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:11:42,475 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:11:42,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:11:42,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4a0685d/b7a5da9b80b74b239638c9a9bd4e9e2d/FLAGcde930bb7 [2023-08-23 23:11:42,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4a0685d/b7a5da9b80b74b239638c9a9bd4e9e2d [2023-08-23 23:11:42,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:11:42,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:11:42,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:42,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:11:42,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:11:42,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:42" (1/1) ... [2023-08-23 23:11:42,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1468dafa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:42, skipping insertion in model container [2023-08-23 23:11:42,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:11:42" (1/1) ... [2023-08-23 23:11:42,587 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:11:42,751 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-23 23:11:42,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:42,962 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:11:42,973 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-23 23:11:42,993 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:11:42,994 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:11:43,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:11:43,063 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:43,064 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:11:43,070 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:11:43,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43 WrapperNode [2023-08-23 23:11:43,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:11:43,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:43,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:11:43,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:11:43,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,128 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-23 23:11:43,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:11:43,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:11:43,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:11:43,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:11:43,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:11:43,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:11:43,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:11:43,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:11:43,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (1/1) ... [2023-08-23 23:11:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:11:43,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:11:43,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 23:11:43,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:11:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:11:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:11:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:11:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:11:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:11:43,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:11:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:11:43,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:11:43,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:11:43,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:11:43,232 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:11:43,356 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:11:43,358 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:11:43,694 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:11:43,820 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:11:43,820 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:11:43,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:43 BoogieIcfgContainer [2023-08-23 23:11:43,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:11:43,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:11:43,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:11:43,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:11:43,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:11:42" (1/3) ... [2023-08-23 23:11:43,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a32bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:43, skipping insertion in model container [2023-08-23 23:11:43,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:11:43" (2/3) ... [2023-08-23 23:11:43,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a32bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:11:43, skipping insertion in model container [2023-08-23 23:11:43,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:11:43" (3/3) ... [2023-08-23 23:11:43,831 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2023-08-23 23:11:43,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:11:43,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:11:43,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:11:43,902 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:11:43,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:43,995 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:43,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:44,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-23 23:11:44,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-08-23 23:11:44,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:44,039 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:11:44,050 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:44,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:44,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-08-23 23:11:44,081 INFO L124 PetriNetUnfolderBase]: 2/103 cut-off events. [2023-08-23 23:11:44,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:44,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-23 23:11:44,084 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-08-23 23:11:48,010 INFO L134 LiptonReduction]: Checked pairs total: 4380 [2023-08-23 23:11:48,010 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-23 23:11:48,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:11:48,027 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;@8f71aab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:11:48,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:11:48,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:11:48,031 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-23 23:11:48,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:11:48,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:48,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:48,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:48,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1908164489, now seen corresponding path program 1 times [2023-08-23 23:11:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:48,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361944840] [2023-08-23 23:11:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:48,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:48,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361944840] [2023-08-23 23:11:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361944840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:48,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:11:48,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487205802] [2023-08-23 23:11:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:11:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:11:48,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:11:48,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 200 [2023-08-23 23:11:48,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:48,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 200 [2023-08-23 23:11:48,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:48,758 INFO L124 PetriNetUnfolderBase]: 511/847 cut-off events. [2023-08-23 23:11:48,758 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-23 23:11:48,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 847 events. 511/847 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4011 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1655. Up to 580 conditions per place. [2023-08-23 23:11:48,765 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-23 23:11:48,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-08-23 23:11:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-23 23:11:48,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116666666666667 [2023-08-23 23:11:48,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-23 23:11:48,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-23 23:11:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:48,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-23 23:11:48,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,802 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-08-23 23:11:48,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-08-23 23:11:48,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:11:48,807 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-23 23:11:48,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-23 23:11:48,811 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-23 23:11:48,812 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-23 23:11:48,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:48,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:48,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:48,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:11:48,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:48,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash -204910542, now seen corresponding path program 1 times [2023-08-23 23:11:48,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:48,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431151934] [2023-08-23 23:11:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431151934] [2023-08-23 23:11:49,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431151934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:49,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991037860] [2023-08-23 23:11:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:49,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:49,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-23 23:11:49,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:49,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:49,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-23 23:11:49,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:49,998 INFO L124 PetriNetUnfolderBase]: 1018/1526 cut-off events. [2023-08-23 23:11:49,999 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-23 23:11:50,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1526 events. 1018/1526 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6386 event pairs, 201 based on Foata normal form. 30/1556 useless extension candidates. Maximal degree in co-relation 3171. Up to 1286 conditions per place. [2023-08-23 23:11:50,008 INFO L140 encePairwiseOnDemand]: 192/200 looper letters, 34 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2023-08-23 23:11:50,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 188 flow [2023-08-23 23:11:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-08-23 23:11:50,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46125 [2023-08-23 23:11:50,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-08-23 23:11:50,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-08-23 23:11:50,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:50,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-08-23 23:11:50,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,014 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 369 transitions. [2023-08-23 23:11:50,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 188 flow [2023-08-23 23:11:50,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:50,016 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 102 flow [2023-08-23 23:11:50,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-08-23 23:11:50,017 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-23 23:11:50,017 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 102 flow [2023-08-23 23:11:50,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:50,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:50,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:11:50,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:50,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2057260820, now seen corresponding path program 1 times [2023-08-23 23:11:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:50,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23005285] [2023-08-23 23:11:50,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23005285] [2023-08-23 23:11:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23005285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:11:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791264855] [2023-08-23 23:11:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:50,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:50,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:50,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 200 [2023-08-23 23:11:50,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:50,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 200 [2023-08-23 23:11:50,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:50,770 INFO L124 PetriNetUnfolderBase]: 824/1294 cut-off events. [2023-08-23 23:11:50,771 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2023-08-23 23:11:50,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 1294 events. 824/1294 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5812 event pairs, 200 based on Foata normal form. 9/1256 useless extension candidates. Maximal degree in co-relation 3478. Up to 1025 conditions per place. [2023-08-23 23:11:50,779 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 30 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-08-23 23:11:50,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 197 flow [2023-08-23 23:11:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:11:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:11:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-23 23:11:50,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2023-08-23 23:11:50,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-23 23:11:50,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-23 23:11:50,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:50,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-23 23:11:50,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,785 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 102 flow. Second operand 3 states and 296 transitions. [2023-08-23 23:11:50,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 197 flow [2023-08-23 23:11:50,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-23 23:11:50,787 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 123 flow [2023-08-23 23:11:50,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-23 23:11:50,788 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-23 23:11:50,789 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 123 flow [2023-08-23 23:11:50,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:50,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:50,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:50,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:11:50,790 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:50,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash -537290992, now seen corresponding path program 1 times [2023-08-23 23:11:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081613823] [2023-08-23 23:11:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081613823] [2023-08-23 23:11:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081613823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:51,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:51,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207431223] [2023-08-23 23:11:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:51,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:51,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-23 23:11:51,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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 23:11:51,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:51,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-23 23:11:51,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:51,498 INFO L124 PetriNetUnfolderBase]: 842/1327 cut-off events. [2023-08-23 23:11:51,499 INFO L125 PetriNetUnfolderBase]: For 891/905 co-relation queries the response was YES. [2023-08-23 23:11:51,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1327 events. 842/1327 cut-off events. For 891/905 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6175 event pairs, 184 based on Foata normal form. 52/1322 useless extension candidates. Maximal degree in co-relation 3806. Up to 714 conditions per place. [2023-08-23 23:11:51,507 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 38 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-23 23:11:51,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 280 flow [2023-08-23 23:11:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2023-08-23 23:11:51,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48125 [2023-08-23 23:11:51,509 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 385 transitions. [2023-08-23 23:11:51,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions. [2023-08-23 23:11:51,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:51,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions. [2023-08-23 23:11:51,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,513 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:51,513 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 123 flow. Second operand 4 states and 385 transitions. [2023-08-23 23:11:51,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 280 flow [2023-08-23 23:11:51,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:51,518 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 168 flow [2023-08-23 23:11:51,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-23 23:11:51,520 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-23 23:11:51,520 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 168 flow [2023-08-23 23:11:51,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 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 23:11:51,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:51,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:51,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:11:51,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:51,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1342710007, now seen corresponding path program 1 times [2023-08-23 23:11:51,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:51,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667035761] [2023-08-23 23:11:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:52,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:52,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667035761] [2023-08-23 23:11:52,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667035761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:52,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:52,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:52,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378849295] [2023-08-23 23:11:52,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:52,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:52,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:52,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 200 [2023-08-23 23:11:52,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:52,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 200 [2023-08-23 23:11:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:52,377 INFO L124 PetriNetUnfolderBase]: 1269/1947 cut-off events. [2023-08-23 23:11:52,377 INFO L125 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2023-08-23 23:11:52,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 1947 events. 1269/1947 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8913 event pairs, 254 based on Foata normal form. 48/1995 useless extension candidates. Maximal degree in co-relation 6072. Up to 1082 conditions per place. [2023-08-23 23:11:52,386 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 46 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2023-08-23 23:11:52,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 369 flow [2023-08-23 23:11:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:11:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:11:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-08-23 23:11:52,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45875 [2023-08-23 23:11:52,388 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-08-23 23:11:52,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-08-23 23:11:52,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:52,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-08-23 23:11:52,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,391 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,391 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 168 flow. Second operand 4 states and 367 transitions. [2023-08-23 23:11:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 369 flow [2023-08-23 23:11:52,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 23:11:52,395 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 217 flow [2023-08-23 23:11:52,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-08-23 23:11:52,396 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-23 23:11:52,396 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 217 flow [2023-08-23 23:11:52,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:52,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:52,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:11:52,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:52,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash -198083121, now seen corresponding path program 1 times [2023-08-23 23:11:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409064040] [2023-08-23 23:11:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409064040] [2023-08-23 23:11:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409064040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:11:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855150865] [2023-08-23 23:11:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:11:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:11:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:11:52,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-23 23:11:52,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:52,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-23 23:11:52,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:52,781 INFO L124 PetriNetUnfolderBase]: 706/1196 cut-off events. [2023-08-23 23:11:52,781 INFO L125 PetriNetUnfolderBase]: For 2264/2338 co-relation queries the response was YES. [2023-08-23 23:11:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 1196 events. 706/1196 cut-off events. For 2264/2338 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6473 event pairs, 132 based on Foata normal form. 189/1334 useless extension candidates. Maximal degree in co-relation 4001. Up to 713 conditions per place. [2023-08-23 23:11:52,788 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 44 selfloop transitions, 5 changer transitions 40/94 dead transitions. [2023-08-23 23:11:52,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 732 flow [2023-08-23 23:11:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:11:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:11:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-23 23:11:52,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483 [2023-08-23 23:11:52,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-23 23:11:52,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-23 23:11:52,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:52,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-23 23:11:52,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,795 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,795 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 217 flow. Second operand 5 states and 483 transitions. [2023-08-23 23:11:52,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 732 flow [2023-08-23 23:11:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 94 transitions, 711 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-23 23:11:52,800 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 238 flow [2023-08-23 23:11:52,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-23 23:11:52,802 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-08-23 23:11:52,803 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 238 flow [2023-08-23 23:11:52,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:52,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:52,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:11:52,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:52,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1343625227, now seen corresponding path program 1 times [2023-08-23 23:11:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075911727] [2023-08-23 23:11:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:52,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075911727] [2023-08-23 23:11:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075911727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:11:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744555144] [2023-08-23 23:11:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:52,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:52,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-23 23:11:52,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:52,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:52,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-23 23:11:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:53,189 INFO L124 PetriNetUnfolderBase]: 397/731 cut-off events. [2023-08-23 23:11:53,189 INFO L125 PetriNetUnfolderBase]: For 1950/2035 co-relation queries the response was YES. [2023-08-23 23:11:53,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 731 events. 397/731 cut-off events. For 1950/2035 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3769 event pairs, 42 based on Foata normal form. 145/856 useless extension candidates. Maximal degree in co-relation 2893. Up to 279 conditions per place. [2023-08-23 23:11:53,194 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 51 selfloop transitions, 9 changer transitions 47/112 dead transitions. [2023-08-23 23:11:53,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 112 transitions, 903 flow [2023-08-23 23:11:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:11:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:11:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2023-08-23 23:11:53,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807142857142857 [2023-08-23 23:11:53,196 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2023-08-23 23:11:53,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2023-08-23 23:11:53,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:53,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2023-08-23 23:11:53,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,200 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,201 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 238 flow. Second operand 7 states and 673 transitions. [2023-08-23 23:11:53,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 112 transitions, 903 flow [2023-08-23 23:11:53,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 112 transitions, 885 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-23 23:11:53,207 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 283 flow [2023-08-23 23:11:53,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-23 23:11:53,208 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2023-08-23 23:11:53,209 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 283 flow [2023-08-23 23:11:53,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:53,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:53,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:11:53,209 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:53,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 318972699, now seen corresponding path program 1 times [2023-08-23 23:11:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498984568] [2023-08-23 23:11:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:53,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498984568] [2023-08-23 23:11:53,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498984568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007453023] [2023-08-23 23:11:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:53,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:11:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:53,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:11:53,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:11:53,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-23 23:11:53,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 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 23:11:53,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:53,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-23 23:11:53,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:53,582 INFO L124 PetriNetUnfolderBase]: 326/607 cut-off events. [2023-08-23 23:11:53,582 INFO L125 PetriNetUnfolderBase]: For 1724/1779 co-relation queries the response was YES. [2023-08-23 23:11:53,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 607 events. 326/607 cut-off events. For 1724/1779 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3116 event pairs, 34 based on Foata normal form. 58/646 useless extension candidates. Maximal degree in co-relation 2562. Up to 220 conditions per place. [2023-08-23 23:11:53,586 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 40 selfloop transitions, 12 changer transitions 54/109 dead transitions. [2023-08-23 23:11:53,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 109 transitions, 916 flow [2023-08-23 23:11:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:11:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:11:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 845 transitions. [2023-08-23 23:11:53,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46944444444444444 [2023-08-23 23:11:53,589 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 845 transitions. [2023-08-23 23:11:53,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 845 transitions. [2023-08-23 23:11:53,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:53,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 845 transitions. [2023-08-23 23:11:53,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,594 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:53,594 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 283 flow. Second operand 9 states and 845 transitions. [2023-08-23 23:11:53,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 109 transitions, 916 flow [2023-08-23 23:11:53,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 870 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-23 23:11:53,601 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 250 flow [2023-08-23 23:11:53,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2023-08-23 23:11:53,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2023-08-23 23:11:53,602 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 250 flow [2023-08-23 23:11:53,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 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 23:11:53,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:53,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:11:53,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:53,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash 913233209, now seen corresponding path program 1 times [2023-08-23 23:11:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:53,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935959914] [2023-08-23 23:11:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:54,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935959914] [2023-08-23 23:11:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935959914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:54,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:54,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:11:54,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098048446] [2023-08-23 23:11:54,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:54,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:11:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:11:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:11:54,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 200 [2023-08-23 23:11:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:54,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 200 [2023-08-23 23:11:54,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:54,344 INFO L124 PetriNetUnfolderBase]: 256/468 cut-off events. [2023-08-23 23:11:54,344 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2023-08-23 23:11:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 468 events. 256/468 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1911 event pairs, 26 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 1950. Up to 257 conditions per place. [2023-08-23 23:11:54,347 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 29 selfloop transitions, 6 changer transitions 42/77 dead transitions. [2023-08-23 23:11:54,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 697 flow [2023-08-23 23:11:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:11:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:11:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2023-08-23 23:11:54,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43833333333333335 [2023-08-23 23:11:54,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2023-08-23 23:11:54,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2023-08-23 23:11:54,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:54,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2023-08-23 23:11:54,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:54,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:54,353 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:54,353 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 250 flow. Second operand 6 states and 526 transitions. [2023-08-23 23:11:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 697 flow [2023-08-23 23:11:54,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 578 flow, removed 29 selfloop flow, removed 9 redundant places. [2023-08-23 23:11:54,358 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 170 flow [2023-08-23 23:11:54,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-23 23:11:54,359 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-08-23 23:11:54,359 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 170 flow [2023-08-23 23:11:54,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:54,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:54,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:54,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:11:54,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:54,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 415372011, now seen corresponding path program 2 times [2023-08-23 23:11:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938694079] [2023-08-23 23:11:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:11:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:11:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:11:55,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938694079] [2023-08-23 23:11:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938694079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:11:55,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:11:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:11:55,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48137572] [2023-08-23 23:11:55,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:11:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:11:55,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:11:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:11:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:11:55,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-23 23:11:55,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:55,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:11:55,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-23 23:11:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:11:55,171 INFO L124 PetriNetUnfolderBase]: 62/151 cut-off events. [2023-08-23 23:11:55,171 INFO L125 PetriNetUnfolderBase]: For 261/263 co-relation queries the response was YES. [2023-08-23 23:11:55,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 151 events. 62/151 cut-off events. For 261/263 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 529 event pairs, 3 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 567. Up to 69 conditions per place. [2023-08-23 23:11:55,172 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 26 selfloop transitions, 5 changer transitions 14/47 dead transitions. [2023-08-23 23:11:55,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 357 flow [2023-08-23 23:11:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:11:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:11:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2023-08-23 23:11:55,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608333333333333 [2023-08-23 23:11:55,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2023-08-23 23:11:55,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2023-08-23 23:11:55,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:11:55,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2023-08-23 23:11:55,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:55,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:55,178 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:55,178 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 170 flow. Second operand 6 states and 553 transitions. [2023-08-23 23:11:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 357 flow [2023-08-23 23:11:55,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 324 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-23 23:11:55,181 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 154 flow [2023-08-23 23:11:55,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-23 23:11:55,181 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-08-23 23:11:55,181 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 154 flow [2023-08-23 23:11:55,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.57142857142857) internal successors, (627), 7 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:11:55,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:11:55,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:11:55,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-23 23:11:55,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:11:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1554954407, now seen corresponding path program 3 times [2023-08-23 23:11:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:11:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214311000] [2023-08-23 23:11:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:11:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:11:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:55,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:11:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:11:55,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:11:55,264 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:11:55,265 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:11:55,266 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:11:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:11:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:11:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:11:55,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:11:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:11:55,268 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:11:55,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:11:55,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:11:55,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:11:55 BasicIcfg [2023-08-23 23:11:55,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:11:55,346 INFO L158 Benchmark]: Toolchain (without parser) took 12819.76ms. Allocated memory was 358.6MB in the beginning and 723.5MB in the end (delta: 364.9MB). Free memory was 334.1MB in the beginning and 450.7MB in the end (delta: -116.7MB). Peak memory consumption was 249.8MB. Max. memory is 16.0GB. [2023-08-23 23:11:55,346 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 358.6MB. Free memory was 337.1MB in the beginning and 337.0MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:11:55,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.86ms. Allocated memory is still 358.6MB. Free memory was 333.6MB in the beginning and 311.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:11:55,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.71ms. Allocated memory is still 358.6MB. Free memory was 311.0MB in the beginning and 307.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:11:55,347 INFO L158 Benchmark]: Boogie Preprocessor took 29.61ms. Allocated memory is still 358.6MB. Free memory was 307.8MB in the beginning and 306.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 23:11:55,347 INFO L158 Benchmark]: RCFGBuilder took 663.48ms. Allocated memory is still 358.6MB. Free memory was 306.1MB in the beginning and 271.7MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-23 23:11:55,348 INFO L158 Benchmark]: TraceAbstraction took 11519.47ms. Allocated memory was 358.6MB in the beginning and 723.5MB in the end (delta: 364.9MB). Free memory was 270.6MB in the beginning and 450.7MB in the end (delta: -180.1MB). Peak memory consumption was 186.9MB. Max. memory is 16.0GB. [2023-08-23 23:11:55,349 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.14ms. Allocated memory is still 358.6MB. Free memory was 337.1MB in the beginning and 337.0MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 544.86ms. Allocated memory is still 358.6MB. Free memory was 333.6MB in the beginning and 311.0MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.71ms. Allocated memory is still 358.6MB. Free memory was 311.0MB in the beginning and 307.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 29.61ms. Allocated memory is still 358.6MB. Free memory was 307.8MB in the beginning and 306.1MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 663.48ms. Allocated memory is still 358.6MB. Free memory was 306.1MB in the beginning and 271.7MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 11519.47ms. Allocated memory was 358.6MB in the beginning and 723.5MB in the end (delta: 364.9MB). Free memory was 270.6MB in the beginning and 450.7MB in the end (delta: -180.1MB). Peak memory consumption was 186.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 111 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2228, independent: 2081, independent conditional: 0, independent unconditional: 2081, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 983, independent: 942, independent conditional: 0, independent unconditional: 942, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2228, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 983, unknown conditional: 0, unknown unconditional: 983] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 820]: 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: 818]: 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: 816]: 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, 132 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: 11.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 17 mSDtfsCounter, 613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=7, InterpolantAutomatonStates: 51, 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.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 23:11:55,372 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...