/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:24:57,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:24:57,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:24:57,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:24:57,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:24:57,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:24:57,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:24:57,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:24:57,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:24:57,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:24:57,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:24:57,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:24:57,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:24:57,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:24:57,209 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:24:57,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:24:57,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:24:57,210 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:24:57,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:24:57,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:24:57,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:24:57,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:24:57,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:24:57,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:24:57,211 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:24:57,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:24:57,212 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:24:57,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:24:57,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:24:57,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:24:57,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:57,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:24:57,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:24:57,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:24:57,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:24:57,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:24:57,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:24:57,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:24:57,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:24:57,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:24:57,215 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:24:57,215 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:24:57,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:24:57,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:24:57,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:24:57,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:24:57,481 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:24:57,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:24:58,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:24:59,019 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:24:59,019 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:24:59,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cddab1e/fba55c9455c94faca9562ac4091efde4/FLAG06c05e405 [2023-08-04 07:24:59,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cddab1e/fba55c9455c94faca9562ac4091efde4 [2023-08-04 07:24:59,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:24:59,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:24:59,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:59,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:24:59,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:24:59,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc6eaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59, skipping insertion in model container [2023-08-04 07:24:59,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,107 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:24:59,236 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 07:24:59,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:59,468 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:24:59,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 07:24:59,493 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:59,495 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 07:24:59,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:59,547 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:59,547 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:59,553 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:24:59,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59 WrapperNode [2023-08-04 07:24:59,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:59,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:59,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:24:59,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:24:59,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,626 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-04 07:24:59,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:59,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:24:59,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:24:59,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:24:59,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:24:59,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:24:59,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:24:59,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:24:59,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (1/1) ... [2023-08-04 07:24:59,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:59,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:59,742 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-04 07:24:59,768 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-04 07:24:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:24:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:24:59,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:24:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:24:59,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:24:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:24:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:24:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:24:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:24:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:24:59,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:24:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:24:59,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:24:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:24:59,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:24:59,786 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 07:24:59,938 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:24:59,940 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:25:00,223 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:25:00,364 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:25:00,364 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:25:00,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:25:00 BoogieIcfgContainer [2023-08-04 07:25:00,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:25:00,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:25:00,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:25:00,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:25:00,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:24:59" (1/3) ... [2023-08-04 07:25:00,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a35bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:25:00, skipping insertion in model container [2023-08-04 07:25:00,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:59" (2/3) ... [2023-08-04 07:25:00,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a35bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:25:00, skipping insertion in model container [2023-08-04 07:25:00,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:25:00" (3/3) ... [2023-08-04 07:25:00,377 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe030_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 07:25:00,384 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:25:00,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:25:00,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 07:25:00,391 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:25:00,450 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:25:00,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 126 transitions, 267 flow [2023-08-04 07:25:00,635 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 07:25:00,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:00,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1978 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 265. Up to 16 conditions per place. [2023-08-04 07:25:00,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 126 transitions, 267 flow [2023-08-04 07:25:00,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 124 transitions, 259 flow [2023-08-04 07:25:00,651 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:00,658 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 124 transitions, 259 flow [2023-08-04 07:25:00,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 124 transitions, 259 flow [2023-08-04 07:25:00,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 124 transitions, 259 flow [2023-08-04 07:25:00,715 INFO L124 PetriNetUnfolderBase]: 30/445 cut-off events. [2023-08-04 07:25:00,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:00,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 445 events. 30/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1955 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 259. Up to 16 conditions per place. [2023-08-04 07:25:00,722 INFO L119 LiptonReduction]: Number of co-enabled transitions 2462 [2023-08-04 07:25:04,589 INFO L134 LiptonReduction]: Checked pairs total: 5448 [2023-08-04 07:25:04,589 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-04 07:25:04,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:25:04,609 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=true, 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;@ff692dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:04,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:25:04,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:04,614 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 07:25:04,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:04,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:04,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:25:04,616 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:04,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1026368674, now seen corresponding path program 1 times [2023-08-04 07:25:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339692533] [2023-08-04 07:25:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:04,889 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-04 07:25:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339692533] [2023-08-04 07:25:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339692533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657703945] [2023-08-04 07:25:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:04,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:04,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-04 07:25:04,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:04,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:04,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-04 07:25:04,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:05,330 INFO L124 PetriNetUnfolderBase]: 1189/1936 cut-off events. [2023-08-04 07:25:05,331 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 07:25:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1936 events. 1189/1936 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10515 event pairs, 967 based on Foata normal form. 0/1615 useless extension candidates. Maximal degree in co-relation 3871. Up to 1853 conditions per place. [2023-08-04 07:25:05,347 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 25 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 07:25:05,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 131 flow [2023-08-04 07:25:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-04 07:25:05,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943502824858757 [2023-08-04 07:25:05,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-04 07:25:05,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-04 07:25:05,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:05,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-04 07:25:05,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,388 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 69 flow. Second operand 3 states and 350 transitions. [2023-08-04 07:25:05,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 131 flow [2023-08-04 07:25:05,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:05,393 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 77 flow [2023-08-04 07:25:05,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-04 07:25:05,398 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-04 07:25:05,398 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 77 flow [2023-08-04 07:25:05,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:05,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:05,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:25:05,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:05,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 779283122, now seen corresponding path program 1 times [2023-08-04 07:25:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99737257] [2023-08-04 07:25:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:25:05,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:05,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99737257] [2023-08-04 07:25:05,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99737257] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:05,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449684158] [2023-08-04 07:25:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:05,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:05,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:05,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:25:05,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 07:25:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:05,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:25:05,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:05,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:25:05,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449684158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:05,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:25:05,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:25:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829236346] [2023-08-04 07:25:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:05,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:05,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-04 07:25:05,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:05,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-04 07:25:05,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:05,937 INFO L124 PetriNetUnfolderBase]: 1035/1646 cut-off events. [2023-08-04 07:25:05,937 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-04 07:25:05,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1646 events. 1035/1646 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8487 event pairs, 888 based on Foata normal form. 0/1394 useless extension candidates. Maximal degree in co-relation 3307. Up to 1551 conditions per place. [2023-08-04 07:25:05,949 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 28 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 07:25:05,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 151 flow [2023-08-04 07:25:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-04 07:25:05,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985875706214689 [2023-08-04 07:25:05,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-04 07:25:05,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-04 07:25:05,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:05,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-04 07:25:05,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,963 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 77 flow. Second operand 3 states and 353 transitions. [2023-08-04 07:25:05,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 151 flow [2023-08-04 07:25:05,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:25:05,966 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 81 flow [2023-08-04 07:25:05,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-04 07:25:05,967 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-04 07:25:05,967 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 81 flow [2023-08-04 07:25:05,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:05,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:05,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:05,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 07:25:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:06,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:06,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash 637187022, now seen corresponding path program 1 times [2023-08-04 07:25:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:06,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625781907] [2023-08-04 07:25:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625781907] [2023-08-04 07:25:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625781907] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670703759] [2023-08-04 07:25:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:06,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:25:06,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 07:25:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:06,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:25:06,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:06,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:25:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:06,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670703759] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:25:06,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:25:06,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:25:06,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068833576] [2023-08-04 07:25:06,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:25:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:25:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:25:06,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:06,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-08-04 07:25:06,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:06,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:06,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-08-04 07:25:06,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:06,464 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 07:25:06,464 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:25:06,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 4/16 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 1 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 07:25:06,465 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 07:25:06,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 10 transitions, 43 flow [2023-08-04 07:25:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:25:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:25:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-04 07:25:06,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597457627118644 [2023-08-04 07:25:06,467 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-04 07:25:06,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-04 07:25:06,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:06,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-04 07:25:06,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:06,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:06,471 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:06,471 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 81 flow. Second operand 4 states and 434 transitions. [2023-08-04 07:25:06,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 10 transitions, 43 flow [2023-08-04 07:25:06,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:25:06,471 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 07:25:06,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=17, PETRI_TRANSITIONS=0} [2023-08-04 07:25:06,473 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -19 predicate places. [2023-08-04 07:25:06,473 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 07:25:06,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:06,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 07:25:06,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 07:25:06,476 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 07:25:06,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 07:25:06,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 07:25:06,682 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 07:25:06,684 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 07:25:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 126 transitions, 267 flow [2023-08-04 07:25:06,726 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 07:25:06,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:06,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1978 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 265. Up to 16 conditions per place. [2023-08-04 07:25:06,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 126 transitions, 267 flow [2023-08-04 07:25:06,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 97 transitions, 209 flow [2023-08-04 07:25:06,729 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:06,729 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 209 flow [2023-08-04 07:25:06,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 209 flow [2023-08-04 07:25:06,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 209 flow [2023-08-04 07:25:06,747 INFO L124 PetriNetUnfolderBase]: 6/216 cut-off events. [2023-08-04 07:25:06,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:06,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 216 events. 6/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 635 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 149. Up to 8 conditions per place. [2023-08-04 07:25:06,750 INFO L119 LiptonReduction]: Number of co-enabled transitions 1282 [2023-08-04 07:25:09,262 INFO L134 LiptonReduction]: Checked pairs total: 3008 [2023-08-04 07:25:09,262 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-08-04 07:25:09,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:25:09,265 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=true, 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;@ff692dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:09,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:25:09,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:09,268 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 07:25:09,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:09,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:09,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:25:09,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:25:09,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1262301728, now seen corresponding path program 1 times [2023-08-04 07:25:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864368089] [2023-08-04 07:25:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864368089] [2023-08-04 07:25:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864368089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25381875] [2023-08-04 07:25:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:09,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:09,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:09,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 203 [2023-08-04 07:25:09,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:09,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:09,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 203 [2023-08-04 07:25:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:09,399 INFO L124 PetriNetUnfolderBase]: 319/618 cut-off events. [2023-08-04 07:25:09,399 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 07:25:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 618 events. 319/618 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3108 event pairs, 247 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 1234. Up to 533 conditions per place. [2023-08-04 07:25:09,403 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 21 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-04 07:25:09,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 119 flow [2023-08-04 07:25:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 07:25:09,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5665024630541872 [2023-08-04 07:25:09,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 07:25:09,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 07:25:09,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:09,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 07:25:09,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:09,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:09,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:09,408 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 345 transitions. [2023-08-04 07:25:09,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 119 flow [2023-08-04 07:25:09,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:09,409 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 07:25:09,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 07:25:09,410 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 07:25:09,410 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 07:25:09,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:09,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:09,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:25:09,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 07:25:09,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:25:09,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1265273880, now seen corresponding path program 1 times [2023-08-04 07:25:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532991979] [2023-08-04 07:25:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:25:09,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:25:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:25:09,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:25:09,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:25:09,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:25:09,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:25:09,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:25:09,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:25:09,476 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:25:09,477 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:25:09,477 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:25:09,477 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:25:09,501 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:25:09,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 150 transitions, 336 flow [2023-08-04 07:25:09,629 INFO L124 PetriNetUnfolderBase]: 93/1389 cut-off events. [2023-08-04 07:25:09,629 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:25:09,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1389 events. 93/1389 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9613 event pairs, 0 based on Foata normal form. 0/1212 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-04 07:25:09,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 150 transitions, 336 flow [2023-08-04 07:25:09,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 148 transitions, 324 flow [2023-08-04 07:25:09,639 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:25:09,639 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 148 transitions, 324 flow [2023-08-04 07:25:09,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 148 transitions, 324 flow [2023-08-04 07:25:09,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 148 transitions, 324 flow [2023-08-04 07:25:09,761 INFO L124 PetriNetUnfolderBase]: 93/1385 cut-off events. [2023-08-04 07:25:09,761 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 07:25:09,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 1385 events. 93/1385 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9580 event pairs, 0 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 991. Up to 54 conditions per place. [2023-08-04 07:25:09,792 INFO L119 LiptonReduction]: Number of co-enabled transitions 5924 [2023-08-04 07:25:13,349 INFO L134 LiptonReduction]: Checked pairs total: 14900 [2023-08-04 07:25:13,350 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-04 07:25:13,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:25:13,352 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=true, 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;@ff692dd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:25:13,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 07:25:13,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:25:13,356 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-04 07:25:13,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:25:13,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:13,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:25:13,356 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:25:13,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1272374927, now seen corresponding path program 1 times [2023-08-04 07:25:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689677409] [2023-08-04 07:25:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:13,433 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-04 07:25:13,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689677409] [2023-08-04 07:25:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689677409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:25:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:25:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119376129] [2023-08-04 07:25:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:13,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:25:13,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 07:25:13,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:13,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:13,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 07:25:13,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:37,961 INFO L124 PetriNetUnfolderBase]: 206750/274641 cut-off events. [2023-08-04 07:25:37,962 INFO L125 PetriNetUnfolderBase]: For 4437/4437 co-relation queries the response was YES. [2023-08-04 07:25:38,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541940 conditions, 274641 events. 206750/274641 cut-off events. For 4437/4437 co-relation queries the response was YES. Maximal size of possible extension queue 7887. Compared 1905857 event pairs, 169944 based on Foata normal form. 0/235770 useless extension candidates. Maximal degree in co-relation 156103. Up to 261960 conditions per place. [2023-08-04 07:25:39,774 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-04 07:25:39,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 212 flow [2023-08-04 07:25:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-04 07:25:39,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2023-08-04 07:25:39,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-04 07:25:39,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-04 07:25:39,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:39,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-04 07:25:39,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:39,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:39,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:39,780 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 122 flow. Second operand 3 states and 414 transitions. [2023-08-04 07:25:39,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 212 flow [2023-08-04 07:25:39,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 210 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:39,787 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 132 flow [2023-08-04 07:25:39,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-04 07:25:39,788 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-08-04 07:25:39,788 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 132 flow [2023-08-04 07:25:39,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:39,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:39,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:39,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:25:39,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:25:39,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1506064257, now seen corresponding path program 1 times [2023-08-04 07:25:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694338918] [2023-08-04 07:25:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:25:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694338918] [2023-08-04 07:25:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694338918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13313381] [2023-08-04 07:25:39,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:39,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:25:39,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 07:25:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:39,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:25:39,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:39,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:25:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13313381] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:39,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:25:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:25:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316993921] [2023-08-04 07:25:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:39,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:39,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 07:25:39,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:39,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:39,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 07:25:39,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:02,109 INFO L124 PetriNetUnfolderBase]: 200318/265376 cut-off events. [2023-08-04 07:26:02,109 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-08-04 07:26:02,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523573 conditions, 265376 events. 200318/265376 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 7770. Compared 1840665 event pairs, 160850 based on Foata normal form. 0/231044 useless extension candidates. Maximal degree in co-relation 523536. Up to 252785 conditions per place. [2023-08-04 07:26:04,079 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 45 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 07:26:04,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 244 flow [2023-08-04 07:26:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:26:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:26:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-04 07:26:04,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230961298377028 [2023-08-04 07:26:04,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-04 07:26:04,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-04 07:26:04,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:04,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-04 07:26:04,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:04,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:04,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:04,094 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 132 flow. Second operand 3 states and 419 transitions. [2023-08-04 07:26:04,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 244 flow [2023-08-04 07:26:04,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:26:04,098 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 142 flow [2023-08-04 07:26:04,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-08-04 07:26:04,101 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2023-08-04 07:26:04,101 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 142 flow [2023-08-04 07:26:04,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:04,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:04,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:04,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 07:26:04,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:04,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:26:04,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash 126109146, now seen corresponding path program 1 times [2023-08-04 07:26:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:04,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872813676] [2023-08-04 07:26:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:26:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:26:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872813676] [2023-08-04 07:26:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872813676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:26:04,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852973012] [2023-08-04 07:26:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:26:04,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:26:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 07:26:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:04,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:26:04,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:26:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:26:04,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:26:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852973012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:26:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:26:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:26:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987528267] [2023-08-04 07:26:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:26:04,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:26:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:26:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:26:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:26:04,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 07:26:04,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:04,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:26:04,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 07:26:04,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:26,044 INFO L124 PetriNetUnfolderBase]: 197902/261334 cut-off events. [2023-08-04 07:26:26,044 INFO L125 PetriNetUnfolderBase]: For 1829/1829 co-relation queries the response was YES. [2023-08-04 07:26:26,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516933 conditions, 261334 events. 197902/261334 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 7808. Compared 1797004 event pairs, 154314 based on Foata normal form. 0/228451 useless extension candidates. Maximal degree in co-relation 149344. Up to 243657 conditions per place. [2023-08-04 07:26:27,482 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 53 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 07:26:27,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 284 flow [2023-08-04 07:26:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:26:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:26:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-04 07:26:27,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5318352059925093 [2023-08-04 07:26:27,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-04 07:26:27,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-04 07:26:27,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:27,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-04 07:26:27,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:27,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:27,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:27,488 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 142 flow. Second operand 3 states and 426 transitions. [2023-08-04 07:26:27,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 284 flow [2023-08-04 07:26:27,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:26:27,493 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 152 flow [2023-08-04 07:26:27,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-08-04 07:26:27,494 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-04 07:26:27,494 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 152 flow [2023-08-04 07:26:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:27,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:27,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:27,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 07:26:27,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:27,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:26:27,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 126112550, now seen corresponding path program 1 times [2023-08-04 07:26:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004881075] [2023-08-04 07:26:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:26:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:26:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004881075] [2023-08-04 07:26:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004881075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:26:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562571028] [2023-08-04 07:26:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:27,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:27,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:26:27,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:26:27,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 07:26:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:27,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:26:27,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:26:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:26:28,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:26:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:26:28,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562571028] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:26:28,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:26:28,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:26:28,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039044424] [2023-08-04 07:26:28,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:26:28,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:26:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:26:28,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:26:28,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:26:28,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 267 [2023-08-04 07:26:28,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:28,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:26:28,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 267 [2023-08-04 07:26:28,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:44,826 INFO L124 PetriNetUnfolderBase]: 154888/200414 cut-off events. [2023-08-04 07:26:44,826 INFO L125 PetriNetUnfolderBase]: For 13659/13659 co-relation queries the response was YES. [2023-08-04 07:26:45,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410258 conditions, 200414 events. 154888/200414 cut-off events. For 13659/13659 co-relation queries the response was YES. Maximal size of possible extension queue 6163. Compared 1269795 event pairs, 103236 based on Foata normal form. 3/179321 useless extension candidates. Maximal degree in co-relation 145342. Up to 193594 conditions per place. [2023-08-04 07:26:46,005 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 44 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2023-08-04 07:26:46,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 264 flow [2023-08-04 07:26:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:26:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:26:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2023-08-04 07:26:46,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5046816479400749 [2023-08-04 07:26:46,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2023-08-04 07:26:46,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2023-08-04 07:26:46,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:46,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2023-08-04 07:26:46,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:46,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:46,011 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:46,011 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 152 flow. Second operand 4 states and 539 transitions. [2023-08-04 07:26:46,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 264 flow [2023-08-04 07:26:46,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 58 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:26:46,018 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 164 flow [2023-08-04 07:26:46,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-08-04 07:26:46,019 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2023-08-04 07:26:46,019 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 164 flow [2023-08-04 07:26:46,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:46,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:46,020 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:46,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 07:26:46,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:46,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:26:46,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1278121355, now seen corresponding path program 1 times [2023-08-04 07:26:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:46,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002188147] [2023-08-04 07:26:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:26:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:26:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002188147] [2023-08-04 07:26:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002188147] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:26:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735003737] [2023-08-04 07:26:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:26:46,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:26:46,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 07:26:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:46,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:26:46,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:26:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:26:46,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:26:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 07:26:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735003737] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:26:46,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:26:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:26:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476934840] [2023-08-04 07:26:46,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:26:46,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:26:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:26:46,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:26:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:26:46,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 267 [2023-08-04 07:26:46,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:46,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:26:46,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 267 [2023-08-04 07:26:46,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:00,512 INFO L124 PetriNetUnfolderBase]: 128752/165334 cut-off events. [2023-08-04 07:27:00,512 INFO L125 PetriNetUnfolderBase]: For 10125/10125 co-relation queries the response was YES. [2023-08-04 07:27:00,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337550 conditions, 165334 events. 128752/165334 cut-off events. For 10125/10125 co-relation queries the response was YES. Maximal size of possible extension queue 5647. Compared 1023274 event pairs, 81922 based on Foata normal form. 36/148522 useless extension candidates. Maximal degree in co-relation 119404. Up to 158524 conditions per place. [2023-08-04 07:27:01,488 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 55 selfloop transitions, 3 changer transitions 1/69 dead transitions. [2023-08-04 07:27:01,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 320 flow [2023-08-04 07:27:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-04 07:27:01,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149812734082397 [2023-08-04 07:27:01,490 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-04 07:27:01,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-04 07:27:01,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:01,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-04 07:27:01,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,494 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,494 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 164 flow. Second operand 4 states and 550 transitions. [2023-08-04 07:27:01,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 320 flow [2023-08-04 07:27:01,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 69 transitions, 313 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:27:01,502 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 171 flow [2023-08-04 07:27:01,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-08-04 07:27:01,503 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2023-08-04 07:27:01,503 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 171 flow [2023-08-04 07:27:01,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:01,503 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:01,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 07:27:01,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:01,709 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:27:01,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1305330159, now seen corresponding path program 1 times [2023-08-04 07:27:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307453029] [2023-08-04 07:27:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307453029] [2023-08-04 07:27:01,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307453029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:27:01,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:27:01,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 07:27:01,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673235201] [2023-08-04 07:27:01,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:27:01,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:27:01,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:01,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:27:01,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:27:01,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 267 [2023-08-04 07:27:01,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:01,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 267 [2023-08-04 07:27:01,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:13,412 INFO L124 PetriNetUnfolderBase]: 110296/143863 cut-off events. [2023-08-04 07:27:13,412 INFO L125 PetriNetUnfolderBase]: For 10684/10684 co-relation queries the response was YES. [2023-08-04 07:27:13,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291943 conditions, 143863 events. 110296/143863 cut-off events. For 10684/10684 co-relation queries the response was YES. Maximal size of possible extension queue 5064. Compared 910282 event pairs, 17560 based on Foata normal form. 0/134071 useless extension candidates. Maximal degree in co-relation 103274. Up to 127009 conditions per place. [2023-08-04 07:27:14,246 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 57 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-04 07:27:14,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 342 flow [2023-08-04 07:27:14,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:27:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:27:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-04 07:27:14,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480649188514357 [2023-08-04 07:27:14,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-04 07:27:14,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-04 07:27:14,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:14,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-04 07:27:14,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:14,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:14,251 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:14,251 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 171 flow. Second operand 3 states and 439 transitions. [2023-08-04 07:27:14,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 342 flow [2023-08-04 07:27:14,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:27:14,254 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 185 flow [2023-08-04 07:27:14,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-04 07:27:14,254 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2023-08-04 07:27:14,255 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 185 flow [2023-08-04 07:27:14,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:14,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:14,255 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 07:27:14,255 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:27:14,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1447755501, now seen corresponding path program 1 times [2023-08-04 07:27:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029519571] [2023-08-04 07:27:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029519571] [2023-08-04 07:27:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029519571] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:27:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163474012] [2023-08-04 07:27:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:27:14,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:27:14,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 07:27:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:14,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:27:14,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:27:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:14,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:27:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163474012] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:27:14,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:27:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:27:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997001528] [2023-08-04 07:27:14,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:27:14,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:27:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:27:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:27:14,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 267 [2023-08-04 07:27:14,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:14,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:14,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 267 [2023-08-04 07:27:14,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:25,689 INFO L124 PetriNetUnfolderBase]: 102040/129415 cut-off events. [2023-08-04 07:27:25,690 INFO L125 PetriNetUnfolderBase]: For 14002/14002 co-relation queries the response was YES. [2023-08-04 07:27:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283487 conditions, 129415 events. 102040/129415 cut-off events. For 14002/14002 co-relation queries the response was YES. Maximal size of possible extension queue 4601. Compared 757326 event pairs, 49000 based on Foata normal form. 576/120631 useless extension candidates. Maximal degree in co-relation 99943. Up to 86596 conditions per place. [2023-08-04 07:27:26,496 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 73 selfloop transitions, 4 changer transitions 0/87 dead transitions. [2023-08-04 07:27:26,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 426 flow [2023-08-04 07:27:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2023-08-04 07:27:26,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280898876404494 [2023-08-04 07:27:26,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2023-08-04 07:27:26,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2023-08-04 07:27:26,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:26,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2023-08-04 07:27:26,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,502 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,502 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 185 flow. Second operand 4 states and 564 transitions. [2023-08-04 07:27:26,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 426 flow [2023-08-04 07:27:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:27:26,508 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 202 flow [2023-08-04 07:27:26,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2023-08-04 07:27:26,509 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2023-08-04 07:27:26,509 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 202 flow [2023-08-04 07:27:26,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:26,509 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:26,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 07:27:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:26,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 07:27:26,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1965457579, now seen corresponding path program 1 times [2023-08-04 07:27:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:26,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636216540] [2023-08-04 07:27:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:27:26,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:27:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:27:26,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:27:26,792 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:27:26,792 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 07:27:26,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 07:27:26,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 07:27:26,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 07:27:26,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 07:27:26,793 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:26,793 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 07:27:26,795 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:27:26,795 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:27:26,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:27:26 BasicIcfg [2023-08-04 07:27:26,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:27:26,873 INFO L158 Benchmark]: Toolchain (without parser) took 147822.34ms. Allocated memory was 509.6MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 458.4MB in the beginning and 12.5GB in the end (delta: -12.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-04 07:27:26,874 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 296.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:27:26,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.10ms. Allocated memory is still 509.6MB. Free memory was 458.4MB in the beginning and 435.1MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:27:26,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.66ms. Allocated memory is still 509.6MB. Free memory was 435.1MB in the beginning and 432.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 07:27:26,874 INFO L158 Benchmark]: Boogie Preprocessor took 77.27ms. Allocated memory is still 509.6MB. Free memory was 432.3MB in the beginning and 430.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:27:26,875 INFO L158 Benchmark]: RCFGBuilder took 662.09ms. Allocated memory is still 509.6MB. Free memory was 430.6MB in the beginning and 465.8MB in the end (delta: -35.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.0GB. [2023-08-04 07:27:26,875 INFO L158 Benchmark]: TraceAbstraction took 146502.17ms. Allocated memory was 509.6MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 465.8MB in the beginning and 12.5GB in the end (delta: -12.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-04 07:27:26,876 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.10ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 296.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 505.10ms. Allocated memory is still 509.6MB. Free memory was 458.4MB in the beginning and 435.1MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.66ms. Allocated memory is still 509.6MB. Free memory was 435.1MB in the beginning and 432.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 77.27ms. Allocated memory is still 509.6MB. Free memory was 432.3MB in the beginning and 430.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 662.09ms. Allocated memory is still 509.6MB. Free memory was 430.6MB in the beginning and 465.8MB in the end (delta: -35.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.0GB. * TraceAbstraction took 146502.17ms. Allocated memory was 509.6MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 465.8MB in the beginning and 12.5GB in the end (delta: -12.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 126 PlacesBefore, 36 PlacesAfterwards, 124 TransitionsBefore, 29 TransitionsAfterwards, 2462 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 5 ChoiceCompositions, 110 TotalNumberOfCompositions, 5448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2531, independent: 2388, independent conditional: 0, independent unconditional: 2388, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1299, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2531, independent: 1128, independent conditional: 0, independent unconditional: 1128, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 1299, unknown conditional: 0, unknown unconditional: 1299] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 102 PlacesBefore, 33 PlacesAfterwards, 97 TransitionsBefore, 26 TransitionsAfterwards, 1282 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 3008 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1611, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 650, independent: 636, independent conditional: 0, independent unconditional: 636, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1611, independent: 865, independent conditional: 0, independent unconditional: 865, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 650, unknown conditional: 0, unknown unconditional: 650] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 156 PlacesBefore, 60 PlacesAfterwards, 148 TransitionsBefore, 47 TransitionsAfterwards, 5924 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 117 TotalNumberOfCompositions, 14900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7001, independent: 6756, independent conditional: 0, independent unconditional: 6756, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3059, independent: 2999, independent conditional: 0, independent unconditional: 2999, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7001, independent: 3757, independent conditional: 0, independent unconditional: 3757, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 3059, unknown conditional: 0, unknown unconditional: 3059] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 261, Positive conditional cache size: 0, Positive unconditional cache size: 261, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492[2]; [L812] 0 int asdf=0; VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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] [L812] COND TRUE 0 asdf<2 [L812] FCALL, FORK 0 pthread_create(&t2492[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492[asdf], ((void *)0), P0, ((void *)0))=-3, t2492={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] [L812] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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] [L812] COND TRUE 0 asdf<2 [L812] FCALL, FORK 0 pthread_create(&t2492[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492[asdf], ((void *)0), P0, ((void *)0))=-2, t2492={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] [L812] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={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] [L812] COND FALSE 0 !(asdf<2) [L813] 0 pthread_t t2493[2]; [L814] 0 int asdf=0; VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t2493[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493[asdf], ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={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] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t2493[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493[asdf], ((void *)0), P1, ((void *)0))=0, t2492={5:0}, t2493={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] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={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] [L814] COND FALSE 0 !(asdf<2) [L815] 0 pthread_t t2494[2]; [L816] 0 int asdf=0; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t2494[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494[asdf], ((void *)0), P2, ((void *)0))=1, t2492={5:0}, t2493={6:0}, t2494={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] [L774] 5 y$w_buff1 = y$w_buff0 [L775] 5 y$w_buff0 = 2 [L776] 5 y$w_buff1_used = y$w_buff0_used [L777] 5 y$w_buff0_used = (_Bool)1 [L778] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L778] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={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=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] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t2494[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494[asdf], ((void *)0), P2, ((void *)0))=2, t2492={5:0}, t2493={6:0}, t2494={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=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] [L774] 6 y$w_buff1 = y$w_buff0 [L775] 6 y$w_buff0 = 2 [L776] 6 y$w_buff1_used = y$w_buff0_used [L777] 6 y$w_buff0_used = (_Bool)1 [L778] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, expression=1, 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=2, y$w_buff1_used=1, y=0, z=0] - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 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: 6.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 14 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=2, InterpolantAutomatonStates: 10, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 137.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 131.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 722 IncrementalHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 15 mSDtfsCounter, 722 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1002 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 73/84 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 146 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: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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-04 07:27:26,903 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...