/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_mix035_pso.opt_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:01:18,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:01:18,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:01:18,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:01:18,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:01:18,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:01:18,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:01:18,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:01:18,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:01:18,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:01:18,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:01:18,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:01:18,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:01:18,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:01:18,273 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:01:18,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:01:18,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:01:18,275 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:01:18,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:01:18,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:01:18,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:01:18,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:01:18,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:01:18,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:01:18,282 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:01:18,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:01:18,283 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:01:18,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:01:18,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:01:18,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:01:18,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:01:18,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:01:18,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:01:18,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:01:18,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:01:18,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:01:18,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:01:18,286 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:01:18,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:01:18,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:01:18,287 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:01:18,287 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 06:01:18,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:01:18,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:01:18,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:01:18,585 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:01:18,585 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:01:18,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix035_pso.opt_tso.opt_bound2.i [2023-08-04 06:01:19,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:01:20,162 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:01:20,162 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix035_pso.opt_tso.opt_bound2.i [2023-08-04 06:01:20,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e20b015f/57eaaf79cfb74977b71c09ba246e6ad5/FLAGbc2371281 [2023-08-04 06:01:20,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e20b015f/57eaaf79cfb74977b71c09ba246e6ad5 [2023-08-04 06:01:20,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:01:20,208 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:01:20,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:01:20,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:01:20,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:01:20,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bef490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20, skipping insertion in model container [2023-08-04 06:01:20,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:01:20,434 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_mix035_pso.opt_tso.opt_bound2.i[956,969] [2023-08-04 06:01:20,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:01:20,630 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:01:20,640 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_mix035_pso.opt_tso.opt_bound2.i[956,969] [2023-08-04 06:01:20,647 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:01:20,649 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:01:20,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:01:20,702 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:01:20,703 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:01:20,709 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:01:20,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20 WrapperNode [2023-08-04 06:01:20,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:01:20,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:01:20,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:01:20,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:01:20,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,753 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-04 06:01:20,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:01:20,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:01:20,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:01:20,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:01:20,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:01:20,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:01:20,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:01:20,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:01:20,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (1/1) ... [2023-08-04 06:01:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:01:20,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:01:20,829 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 06:01:20,831 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 06:01:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:01:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:01:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:01:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:01:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:01:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:01:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:01:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:01:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:01:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:01:20,862 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 06:01:21,000 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:01:21,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:01:21,268 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:01:21,434 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:01:21,435 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:01:21,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:01:21 BoogieIcfgContainer [2023-08-04 06:01:21,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:01:21,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:01:21,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:01:21,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:01:21,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:01:20" (1/3) ... [2023-08-04 06:01:21,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533c67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:01:21, skipping insertion in model container [2023-08-04 06:01:21,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:01:20" (2/3) ... [2023-08-04 06:01:21,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533c67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:01:21, skipping insertion in model container [2023-08-04 06:01:21,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:01:21" (3/3) ... [2023-08-04 06:01:21,450 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix035_pso.opt_tso.opt_bound2.i [2023-08-04 06:01:21,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:01:21,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:01:21,465 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:01:21,465 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:01:21,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:01:21,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 279 flow [2023-08-04 06:01:21,714 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:01:21,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:21,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2045 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:01:21,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 279 flow [2023-08-04 06:01:21,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 130 transitions, 271 flow [2023-08-04 06:01:21,738 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:01:21,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 130 transitions, 271 flow [2023-08-04 06:01:21,763 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 130 transitions, 271 flow [2023-08-04 06:01:21,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 130 transitions, 271 flow [2023-08-04 06:01:21,840 INFO L124 PetriNetUnfolderBase]: 30/456 cut-off events. [2023-08-04 06:01:21,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:21,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 456 events. 30/456 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2019 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 262. Up to 16 conditions per place. [2023-08-04 06:01:21,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 2532 [2023-08-04 06:01:25,159 INFO L134 LiptonReduction]: Checked pairs total: 5503 [2023-08-04 06:01:25,159 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-04 06:01:25,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:01:25,177 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;@39c94d12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:01:25,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:01:25,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:01:25,181 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-04 06:01:25,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:25,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:25,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:01:25,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:01:25,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash -758211207, now seen corresponding path program 1 times [2023-08-04 06:01:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561307847] [2023-08-04 06:01:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:25,434 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 06:01:25,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:25,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561307847] [2023-08-04 06:01:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561307847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:01:25,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:01:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:01:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384140447] [2023-08-04 06:01:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:01:25,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:01:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:01:25,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:01:25,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-08-04 06:01:25,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 06:01:25,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:25,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-08-04 06:01:25,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:25,927 INFO L124 PetriNetUnfolderBase]: 1828/2929 cut-off events. [2023-08-04 06:01:25,927 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 06:01:25,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5795 conditions, 2929 events. 1828/2929 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15699 event pairs, 1176 based on Foata normal form. 105/2536 useless extension candidates. Maximal degree in co-relation 5782. Up to 2807 conditions per place. [2023-08-04 06:01:25,944 INFO L140 encePairwiseOnDemand]: 242/246 looper letters, 28 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 06:01:25,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 141 flow [2023-08-04 06:01:25,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 06:01:25,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508130081300813 [2023-08-04 06:01:25,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 06:01:25,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 06:01:25,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 06:01:25,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 06:01:25,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:25,971 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:25,973 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 75 flow. Second operand 3 states and 375 transitions. [2023-08-04 06:01:25,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 141 flow [2023-08-04 06:01:25,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:01:25,977 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 81 flow [2023-08-04 06:01:25,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-04 06:01:25,982 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-04 06:01:25,982 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 81 flow [2023-08-04 06:01:25,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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 06:01:25,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:25,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:01:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:01:25,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:01:25,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 88707306, now seen corresponding path program 1 times [2023-08-04 06:01:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962970010] [2023-08-04 06:01:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:26,099 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 06:01:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962970010] [2023-08-04 06:01:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962970010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:01:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328817818] [2023-08-04 06:01:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:26,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:01:26,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:01:26,104 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 06:01:26,122 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 06:01:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:26,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:01:26,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:01:26,212 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 06:01:26,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:01:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328817818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:01:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:01:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:01:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661770007] [2023-08-04 06:01:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:01:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:01:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:01:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:01:26,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-08-04 06:01:26,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 06:01:26,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:26,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-08-04 06:01:26,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:26,500 INFO L124 PetriNetUnfolderBase]: 1584/2478 cut-off events. [2023-08-04 06:01:26,501 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 06:01:26,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 2478 events. 1584/2478 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12538 event pairs, 996 based on Foata normal form. 0/2081 useless extension candidates. Maximal degree in co-relation 4904. Up to 2352 conditions per place. [2023-08-04 06:01:26,515 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 31 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2023-08-04 06:01:26,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 161 flow [2023-08-04 06:01:26,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-04 06:01:26,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510840108401084 [2023-08-04 06:01:26,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-04 06:01:26,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-04 06:01:26,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:26,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-04 06:01:26,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states 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 06:01:26,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:26,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:26,527 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 81 flow. Second operand 3 states and 377 transitions. [2023-08-04 06:01:26,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 161 flow [2023-08-04 06:01:26,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:01:26,529 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 85 flow [2023-08-04 06:01:26,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-08-04 06:01:26,530 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-04 06:01:26,530 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 85 flow [2023-08-04 06:01:26,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 06:01:26,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:26,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:01:26,543 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 06:01:26,740 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 06:01:26,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:01:26,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2024120394, now seen corresponding path program 1 times [2023-08-04 06:01:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:26,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388554432] [2023-08-04 06:01:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:26,840 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 06:01:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388554432] [2023-08-04 06:01:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388554432] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:01:26,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578445218] [2023-08-04 06:01:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:26,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:01:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:01:26,843 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 06:01:26,846 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 06:01:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:26,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:01:26,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:01:27,001 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 06:01:27,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:01:27,025 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 06:01:27,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578445218] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:01:27,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:01:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:01:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530865785] [2023-08-04 06:01:27,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:01:27,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:01:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:27,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:01:27,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:01:27,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-04 06:01:27,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 06:01:27,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:27,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-04 06:01:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:27,063 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 06:01:27,063 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 06:01:27,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 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 06:01:27,063 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 06:01:27,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 10 transitions, 43 flow [2023-08-04 06:01:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:01:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:01:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-04 06:01:27,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2023-08-04 06:01:27,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-04 06:01:27,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-04 06:01:27,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:27,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-04 06:01:27,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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 06:01:27,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:27,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:27,071 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 85 flow. Second operand 4 states and 462 transitions. [2023-08-04 06:01:27,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 10 transitions, 43 flow [2023-08-04 06:01:27,071 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 06:01:27,072 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 06:01:27,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, 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 06:01:27,073 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -21 predicate places. [2023-08-04 06:01:27,073 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 06:01:27,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 06:01:27,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:01:27,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:01:27,076 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:01:27,087 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 06:01:27,282 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 06:01:27,283 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:01:27,285 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:01:27,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 279 flow [2023-08-04 06:01:27,328 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:01:27,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:27,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2045 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:01:27,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 132 transitions, 279 flow [2023-08-04 06:01:27,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 103 transitions, 221 flow [2023-08-04 06:01:27,331 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:01:27,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 221 flow [2023-08-04 06:01:27,332 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 221 flow [2023-08-04 06:01:27,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 221 flow [2023-08-04 06:01:27,349 INFO L124 PetriNetUnfolderBase]: 6/227 cut-off events. [2023-08-04 06:01:27,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:27,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 227 events. 6/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 674 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. [2023-08-04 06:01:27,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2023-08-04 06:01:30,456 INFO L134 LiptonReduction]: Checked pairs total: 2702 [2023-08-04 06:01:30,457 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-04 06:01:30,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:01:30,459 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;@39c94d12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:01:30,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:01:30,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:01:30,462 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:01:30,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:30,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:30,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:01:30,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:01:30,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1734669251, now seen corresponding path program 1 times [2023-08-04 06:01:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714118375] [2023-08-04 06:01:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:30,535 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 06:01:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:30,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714118375] [2023-08-04 06:01:30,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714118375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:01:30,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:01:30,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:01:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664376458] [2023-08-04 06:01:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:01:30,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:01:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:01:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:01:30,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 216 [2023-08-04 06:01:30,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 06:01:30,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:30,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 216 [2023-08-04 06:01:30,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:30,636 INFO L124 PetriNetUnfolderBase]: 372/636 cut-off events. [2023-08-04 06:01:30,636 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 06:01:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 636 events. 372/636 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2684 event pairs, 210 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 1295. Up to 616 conditions per place. [2023-08-04 06:01:30,641 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 22 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-04 06:01:30,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 119 flow [2023-08-04 06:01:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 06:01:30,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.566358024691358 [2023-08-04 06:01:30,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 06:01:30,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 06:01:30,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:30,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 06:01:30,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:30,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 06:01:30,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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 06:01:30,647 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 65 flow. Second operand 3 states and 367 transitions. [2023-08-04 06:01:30,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 119 flow [2023-08-04 06:01:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:01:30,649 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-08-04 06:01:30,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-08-04 06:01:30,651 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-04 06:01:30,651 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-08-04 06:01:30,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 06:01:30,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:30,652 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:01:30,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:01:30,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:01:30,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1737415574, now seen corresponding path program 1 times [2023-08-04 06:01:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:30,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683011645] [2023-08-04 06:01:30,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:30,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:01:30,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:01:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:01:30,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:01:30,707 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:01:30,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:01:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:01:30,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:01:30,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:01:30,708 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:01:30,708 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:01:30,709 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:01:30,709 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:01:30,737 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:01:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 157 transitions, 350 flow [2023-08-04 06:01:30,866 INFO L124 PetriNetUnfolderBase]: 93/1424 cut-off events. [2023-08-04 06:01:30,866 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:01:30,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1424 events. 93/1424 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9990 event pairs, 0 based on Foata normal form. 0/1247 useless extension candidates. Maximal degree in co-relation 1020. Up to 54 conditions per place. [2023-08-04 06:01:30,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 157 transitions, 350 flow [2023-08-04 06:01:30,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 155 transitions, 338 flow [2023-08-04 06:01:30,900 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:01:30,900 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 155 transitions, 338 flow [2023-08-04 06:01:30,901 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 155 transitions, 338 flow [2023-08-04 06:01:30,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 155 transitions, 338 flow [2023-08-04 06:01:31,022 INFO L124 PetriNetUnfolderBase]: 93/1420 cut-off events. [2023-08-04 06:01:31,023 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 06:01:31,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 1420 events. 93/1420 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9941 event pairs, 0 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 1017. Up to 54 conditions per place. [2023-08-04 06:01:31,056 INFO L119 LiptonReduction]: Number of co-enabled transitions 6148 [2023-08-04 06:01:34,148 INFO L134 LiptonReduction]: Checked pairs total: 18779 [2023-08-04 06:01:34,148 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-04 06:01:34,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:01:34,151 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;@39c94d12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:01:34,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:01:34,155 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:01:34,155 INFO L124 PetriNetUnfolderBase]: 1/23 cut-off events. [2023-08-04 06:01:34,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:01:34,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:34,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:01:34,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:01:34,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2015779667, now seen corresponding path program 1 times [2023-08-04 06:01:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26855502] [2023-08-04 06:01:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:34,186 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 06:01:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26855502] [2023-08-04 06:01:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26855502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:01:34,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:01:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:01:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400957389] [2023-08-04 06:01:34,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:01:34,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:01:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:01:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:01:34,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-04 06:01:34,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 06:01:34,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:34,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-04 06:01:34,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:02:05,828 INFO L124 PetriNetUnfolderBase]: 267242/363543 cut-off events. [2023-08-04 06:02:05,828 INFO L125 PetriNetUnfolderBase]: For 4545/4545 co-relation queries the response was YES. [2023-08-04 06:02:06,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707342 conditions, 363543 events. 267242/363543 cut-off events. For 4545/4545 co-relation queries the response was YES. Maximal size of possible extension queue 11223. Compared 2753535 event pairs, 220020 based on Foata normal form. 7812/317042 useless extension candidates. Maximal degree in co-relation 204293. Up to 338076 conditions per place. [2023-08-04 06:02:08,068 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 41 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 06:02:08,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 224 flow [2023-08-04 06:02:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:02:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:02:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-04 06:02:08,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5345454545454545 [2023-08-04 06:02:08,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-04 06:02:08,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-04 06:02:08,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:02:08,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-04 06:02:08,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 06:02:08,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:02:08,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:02:08,074 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 132 flow. Second operand 3 states and 441 transitions. [2023-08-04 06:02:08,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 224 flow [2023-08-04 06:02:08,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 222 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:02:08,084 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 140 flow [2023-08-04 06:02:08,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-04 06:02:08,084 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-04 06:02:08,085 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 140 flow [2023-08-04 06:02:08,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 06:02:08,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:02:08,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:02:08,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:02:08,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:02:08,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:02:08,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1736371698, now seen corresponding path program 1 times [2023-08-04 06:02:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:02:08,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303231800] [2023-08-04 06:02:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:02:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:02:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:02:08,127 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 06:02:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:02:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303231800] [2023-08-04 06:02:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303231800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:02:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072414592] [2023-08-04 06:02:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:02:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:02:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:02:08,130 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 06:02:08,135 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 06:02:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:02:08,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:02:08,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:02:08,230 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 06:02:08,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:02:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072414592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:02:08,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:02:08,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:02:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187427386] [2023-08-04 06:02:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:02:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:02:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:02:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:02:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:02:08,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-04 06:02:08,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 06:02:08,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:02:08,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-04 06:02:08,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:02:38,989 INFO L124 PetriNetUnfolderBase]: 258886/357916 cut-off events. [2023-08-04 06:02:38,989 INFO L125 PetriNetUnfolderBase]: For 3531/3531 co-relation queries the response was YES. [2023-08-04 06:02:39,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689561 conditions, 357916 events. 258886/357916 cut-off events. For 3531/3531 co-relation queries the response was YES. Maximal size of possible extension queue 11580. Compared 2803676 event pairs, 208258 based on Foata normal form. 0/307455 useless extension candidates. Maximal degree in co-relation 689524. Up to 326233 conditions per place. [2023-08-04 06:02:41,279 INFO L140 encePairwiseOnDemand]: 272/275 looper letters, 47 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 06:02:41,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 256 flow [2023-08-04 06:02:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:02:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:02:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-04 06:02:41,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2023-08-04 06:02:41,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-04 06:02:41,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-04 06:02:41,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:02:41,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-04 06:02:41,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 06:02:41,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:02:41,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:02:41,287 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 140 flow. Second operand 3 states and 445 transitions. [2023-08-04 06:02:41,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 256 flow [2023-08-04 06:02:41,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:02:41,294 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 150 flow [2023-08-04 06:02:41,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-04 06:02:41,297 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2023-08-04 06:02:41,297 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 150 flow [2023-08-04 06:02:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 06:02:41,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:02:41,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:02:41,307 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 06:02:41,506 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 06:02:41,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:02:41,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:02:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash 121019502, now seen corresponding path program 1 times [2023-08-04 06:02:41,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:02:41,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198818524] [2023-08-04 06:02:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:02:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:02:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:02:41,564 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 06:02:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:02:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198818524] [2023-08-04 06:02:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198818524] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:02:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50774733] [2023-08-04 06:02:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:02:41,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:02:41,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:02:41,566 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 06:02:41,569 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 06:02:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:02:41,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:02:41,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:02:41,678 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 06:02:41,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:02:41,697 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 06:02:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50774733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:02:41,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:02:41,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:02:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145560816] [2023-08-04 06:02:41,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:02:41,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:02:41,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:02:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:02:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:02:41,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 275 [2023-08-04 06:02:41,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 06:02:41,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:02:41,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 275 [2023-08-04 06:02:41,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:03:03,931 INFO L124 PetriNetUnfolderBase]: 202606/276878 cut-off events. [2023-08-04 06:03:03,931 INFO L125 PetriNetUnfolderBase]: For 3024/3024 co-relation queries the response was YES. [2023-08-04 06:03:04,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534475 conditions, 276878 events. 202606/276878 cut-off events. For 3024/3024 co-relation queries the response was YES. Maximal size of possible extension queue 9379. Compared 2066714 event pairs, 135114 based on Foata normal form. 3/239215 useless extension candidates. Maximal degree in co-relation 189388. Up to 253192 conditions per place. [2023-08-04 06:03:06,087 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 45 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 06:03:06,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 264 flow [2023-08-04 06:03:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:03:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:03:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-08-04 06:03:06,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209090909090909 [2023-08-04 06:03:06,090 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-08-04 06:03:06,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-08-04 06:03:06,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:03:06,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-08-04 06:03:06,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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 06:03:06,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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 06:03:06,094 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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 06:03:06,095 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 150 flow. Second operand 4 states and 573 transitions. [2023-08-04 06:03:06,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 264 flow [2023-08-04 06:03:06,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:03:06,098 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 162 flow [2023-08-04 06:03:06,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-04 06:03:06,099 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-04 06:03:06,099 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 162 flow [2023-08-04 06:03:06,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 06:03:06,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:03:06,100 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:03:06,110 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 06:03:06,307 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 06:03:06,307 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:03:06,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:03:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1141884268, now seen corresponding path program 1 times [2023-08-04 06:03:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:03:06,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256200812] [2023-08-04 06:03:06,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:03:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:03:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:03:06,380 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 06:03:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:03:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256200812] [2023-08-04 06:03:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256200812] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:03:06,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401807051] [2023-08-04 06:03:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:03:06,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:03:06,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:03:06,385 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 06:03:06,388 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 06:03:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:03:06,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:03:06,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:03:06,505 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 06:03:06,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:03:06,527 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 06:03:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401807051] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:03:06,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:03:06,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:03:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792986125] [2023-08-04 06:03:06,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:03:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:03:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:03:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:03:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:03:06,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 275 [2023-08-04 06:03:06,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 06:03:06,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:03:06,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 275 [2023-08-04 06:03:06,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:03:25,790 INFO L124 PetriNetUnfolderBase]: 168352/228469 cut-off events. [2023-08-04 06:03:25,790 INFO L125 PetriNetUnfolderBase]: For 2205/2205 co-relation queries the response was YES. [2023-08-04 06:03:26,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441004 conditions, 228469 events. 168352/228469 cut-off events. For 2205/2205 co-relation queries the response was YES. Maximal size of possible extension queue 8171. Compared 1649000 event pairs, 107266 based on Foata normal form. 36/198543 useless extension candidates. Maximal degree in co-relation 156001. Up to 207628 conditions per place. [2023-08-04 06:03:27,143 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 56 selfloop transitions, 3 changer transitions 1/72 dead transitions. [2023-08-04 06:03:27,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 320 flow [2023-08-04 06:03:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:03:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:03:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-08-04 06:03:27,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309090909090909 [2023-08-04 06:03:27,145 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-08-04 06:03:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-08-04 06:03:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:03:27,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-08-04 06:03:27,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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 06:03:27,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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 06:03:27,149 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states 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 06:03:27,149 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 162 flow. Second operand 4 states and 584 transitions. [2023-08-04 06:03:27,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 320 flow [2023-08-04 06:03:27,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 72 transitions, 313 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:03:27,152 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 169 flow [2023-08-04 06:03:27,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-04 06:03:27,153 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-04 06:03:27,153 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 169 flow [2023-08-04 06:03:27,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 06:03:27,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:03:27,154 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:03:27,162 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 06:03:27,359 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 06:03:27,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:03:27,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:03:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 757162537, now seen corresponding path program 1 times [2023-08-04 06:03:27,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:03:27,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915047008] [2023-08-04 06:03:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:03:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:03:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:03:27,531 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 06:03:27,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:03:27,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915047008] [2023-08-04 06:03:27,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915047008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:03:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:03:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:03:27,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015069457] [2023-08-04 06:03:27,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:03:27,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:03:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:03:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:03:27,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:03:27,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 275 [2023-08-04 06:03:27,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 169 flow. Second operand has 3 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 06:03:27,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:03:27,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 275 [2023-08-04 06:03:27,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:03:42,954 INFO L124 PetriNetUnfolderBase]: 144616/199837 cut-off events. [2023-08-04 06:03:42,954 INFO L125 PetriNetUnfolderBase]: For 3070/3070 co-relation queries the response was YES. [2023-08-04 06:03:43,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382956 conditions, 199837 events. 144616/199837 cut-off events. For 3070/3070 co-relation queries the response was YES. Maximal size of possible extension queue 6732. Compared 1472314 event pairs, 24520 based on Foata normal form. 0/175203 useless extension candidates. Maximal degree in co-relation 135468. Up to 164161 conditions per place. [2023-08-04 06:03:44,219 INFO L140 encePairwiseOnDemand]: 270/275 looper letters, 59 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-04 06:03:44,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 340 flow [2023-08-04 06:03:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:03:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:03:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-04 06:03:44,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.566060606060606 [2023-08-04 06:03:44,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-04 06:03:44,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-04 06:03:44,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:03:44,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-04 06:03:44,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 06:03:44,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:03:44,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:03:44,224 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 169 flow. Second operand 3 states and 467 transitions. [2023-08-04 06:03:44,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 340 flow [2023-08-04 06:03:44,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:03:44,228 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 183 flow [2023-08-04 06:03:44,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-04 06:03:44,229 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-04 06:03:44,229 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 183 flow [2023-08-04 06:03:44,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 06:03:44,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:03:44,230 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:03:44,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:03:44,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:03:44,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:03:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1997200946, now seen corresponding path program 1 times [2023-08-04 06:03:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:03:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822784040] [2023-08-04 06:03:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:03:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:03:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:03:44,291 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 06:03:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:03:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822784040] [2023-08-04 06:03:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822784040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:03:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:03:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:03:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507862146] [2023-08-04 06:03:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:03:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:03:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:03:44,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:03:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:03:44,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 275 [2023-08-04 06:03:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 06:03:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:03:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 275 [2023-08-04 06:03:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:04:00,344 INFO L124 PetriNetUnfolderBase]: 142168/186733 cut-off events. [2023-08-04 06:04:00,345 INFO L125 PetriNetUnfolderBase]: For 12085/12085 co-relation queries the response was YES. [2023-08-04 06:04:00,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389860 conditions, 186733 events. 142168/186733 cut-off events. For 12085/12085 co-relation queries the response was YES. Maximal size of possible extension queue 7153. Compared 1241290 event pairs, 133096 based on Foata normal form. 0/163755 useless extension candidates. Maximal degree in co-relation 137577. Up to 173284 conditions per place. [2023-08-04 06:04:01,499 INFO L140 encePairwiseOnDemand]: 271/275 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-04 06:04:01,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 332 flow [2023-08-04 06:04:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:04:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:04:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-04 06:04:01,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478787878787879 [2023-08-04 06:04:01,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-04 06:04:01,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-04 06:04:01,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:04:01,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-04 06:04:01,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:01,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:04:01,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states 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 06:04:01,503 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 183 flow. Second operand 3 states and 452 transitions. [2023-08-04 06:04:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 332 flow [2023-08-04 06:04:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:04:01,507 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 194 flow [2023-08-04 06:04:01,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-08-04 06:04:01,508 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2023-08-04 06:04:01,508 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 194 flow [2023-08-04 06:04:01,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 06:04:01,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:01,508 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 06:04:01,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:04:01,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:04:01,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2113272045, now seen corresponding path program 1 times [2023-08-04 06:04:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832440159] [2023-08-04 06:04:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:01,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:04:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:01,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:04:01,549 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:04:01,549 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:04:01,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:04:01,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:04:01,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:04:01,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 06:04:01,550 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:04:01,550 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:04:01,551 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:04:01,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:04:01,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:04:01 BasicIcfg [2023-08-04 06:04:01,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:04:01,639 INFO L158 Benchmark]: Toolchain (without parser) took 161432.34ms. Allocated memory was 346.0MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 298.3MB in the beginning and 11.2GB in the end (delta: -10.9GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-04 06:04:01,639 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 346.0MB. Free memory is still 299.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:04:01,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.62ms. Allocated memory is still 346.0MB. Free memory was 297.9MB in the beginning and 274.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:04:01,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.94ms. Allocated memory is still 346.0MB. Free memory was 274.8MB in the beginning and 272.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:04:01,640 INFO L158 Benchmark]: Boogie Preprocessor took 43.65ms. Allocated memory is still 346.0MB. Free memory was 272.4MB in the beginning and 270.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:04:01,640 INFO L158 Benchmark]: RCFGBuilder took 639.72ms. Allocated memory was 346.0MB in the beginning and 474.0MB in the end (delta: 127.9MB). Free memory was 270.3MB in the beginning and 424.2MB in the end (delta: -153.9MB). Peak memory consumption was 24.3MB. Max. memory is 16.0GB. [2023-08-04 06:04:01,640 INFO L158 Benchmark]: TraceAbstraction took 160195.67ms. Allocated memory was 474.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 424.2MB in the beginning and 11.2GB in the end (delta: -10.8GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-04 06:04:01,641 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.11ms. Allocated memory is still 346.0MB. Free memory is still 299.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.62ms. Allocated memory is still 346.0MB. Free memory was 297.9MB in the beginning and 274.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.94ms. Allocated memory is still 346.0MB. Free memory was 274.8MB in the beginning and 272.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.65ms. Allocated memory is still 346.0MB. Free memory was 272.4MB in the beginning and 270.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 639.72ms. Allocated memory was 346.0MB in the beginning and 474.0MB in the end (delta: 127.9MB). Free memory was 270.3MB in the beginning and 424.2MB in the end (delta: -153.9MB). Peak memory consumption was 24.3MB. Max. memory is 16.0GB. * TraceAbstraction took 160195.67ms. Allocated memory was 474.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 424.2MB in the beginning and 11.2GB in the end (delta: -10.8GB). Peak memory consumption was 4.8GB. 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.4s, 132 PlacesBefore, 38 PlacesAfterwards, 130 TransitionsBefore, 32 TransitionsAfterwards, 2532 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 5503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2696, independent: 2552, independent conditional: 0, independent unconditional: 2552, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1316, independent: 1293, independent conditional: 0, independent unconditional: 1293, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2696, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1316, unknown conditional: 0, unknown unconditional: 1316] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 108 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 84 TotalNumberOfCompositions, 2702 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1483, independent: 1382, independent conditional: 0, independent unconditional: 1382, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 651, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1483, independent: 742, independent conditional: 0, independent unconditional: 742, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 651, unknown conditional: 0, unknown unconditional: 651] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 163 PlacesBefore, 64 PlacesAfterwards, 155 TransitionsBefore, 52 TransitionsAfterwards, 6148 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 18779 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6952, independent: 6625, independent conditional: 0, independent unconditional: 6625, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3020, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6952, independent: 3653, independent conditional: 0, independent unconditional: 3653, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 3020, unknown conditional: 0, unknown unconditional: 3020] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 313, Positive conditional cache size: 0, Positive unconditional cache size: 313, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922[2]; [L836] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t922={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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t922[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922[asdf], ((void *)0), P0, ((void *)0))=-5, t922={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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t922={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] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t922[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922[asdf], ((void *)0), P0, ((void *)0))=-4, t922={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] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={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] [L836] COND FALSE 0 !(asdf<2) [L837] 0 pthread_t t923[2]; [L838] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={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] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t923[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923[asdf], ((void *)0), P1, ((void *)0))=-3, t922={5:0}, t923={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] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={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] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t923[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923[asdf], ((void *)0), P1, ((void *)0))=-2, t922={5:0}, t923={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] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={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] [L838] COND FALSE 0 !(asdf<2) [L839] 0 pthread_t t924[2]; [L840] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={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] [L840] COND TRUE 0 asdf<2 [L840] FCALL, FORK 0 pthread_create(&t924[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924[asdf], ((void *)0), P2, ((void *)0))=-1, t922={5:0}, t923={6:0}, t924={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] [L792] 5 y$w_buff1 = y$w_buff0 [L793] 5 y$w_buff0 = 1 [L794] 5 y$w_buff1_used = y$w_buff0_used [L795] 5 y$w_buff0_used = (_Bool)1 [L796] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L796] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L840] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L840] COND TRUE 0 asdf<2 [L840] FCALL, FORK 0 pthread_create(&t924[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924[asdf], ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 6 y$w_buff1 = y$w_buff0 [L793] 6 y$w_buff0 = 1 [L794] 6 y$w_buff1_used = y$w_buff0_used [L795] 6 y$w_buff0_used = (_Bool)1 [L796] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, expression=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=1, y$w_buff0_used=1, y$w_buff1=1, 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, 153 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: 5.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 155 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=85occurred 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 365 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, 178 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: 150.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 145.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 5 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=6, InterpolantAutomatonStates: 20, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 579 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 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, 153 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: 3.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 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=73occurred 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 06:04:01,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...