/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe031_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:10:38,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:10:38,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:10:38,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:10:38,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:10:38,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:10:38,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:10:38,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:10:38,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:10:38,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:10:38,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:10:38,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:10:38,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:10:38,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:10:38,537 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:10:38,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:10:38,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:10:38,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:10:38,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:10:38,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:10:38,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:10:38,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:10:38,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:10:38,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:10:38,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:10:38,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:10:38,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:10:38,541 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:10:38,542 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 -> INSUFFICIENT_FIRST [2023-08-04 01:10:38,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:10:38,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:10:38,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:10:38,753 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:10:38,754 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:10:38,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe031_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:10:39,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:10:40,143 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:10:40,143 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe031_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:10:40,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d9f6bfe/1f2f4b098d0d4c96be8cbe1c50b0524d/FLAG9c1d6b558 [2023-08-04 01:10:40,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d9f6bfe/1f2f4b098d0d4c96be8cbe1c50b0524d [2023-08-04 01:10:40,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:10:40,176 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:10:40,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:10:40,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:10:40,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:10:40,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3cdfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40, skipping insertion in model container [2023-08-04 01:10:40,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:10:40,310 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_safe031_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 01:10:40,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:10:40,485 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:10:40,496 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_safe031_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 01:10:40,511 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:10:40,513 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:10:40,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:10:40,580 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:10:40,580 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:10:40,585 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:10:40,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40 WrapperNode [2023-08-04 01:10:40,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:10:40,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:10:40,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:10:40,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:10:40,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,618 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-04 01:10:40,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:10:40,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:10:40,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:10:40,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:10:40,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:10:40,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:10:40,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:10:40,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:10:40,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (1/1) ... [2023-08-04 01:10:40,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:10:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:10:40,666 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 01:10:40,678 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 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:10:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 01:10:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 01:10:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 01:10:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 01:10:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 01:10:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 01:10:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:10:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 01:10:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:10:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:10:40,700 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 01:10:40,797 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:10:40,799 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:10:41,059 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:10:41,156 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:10:41,156 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 01:10:41,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:10:41 BoogieIcfgContainer [2023-08-04 01:10:41,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:10:41,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:10:41,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:10:41,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:10:41,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:10:40" (1/3) ... [2023-08-04 01:10:41,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d878579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:10:41, skipping insertion in model container [2023-08-04 01:10:41,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:10:40" (2/3) ... [2023-08-04 01:10:41,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d878579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:10:41, skipping insertion in model container [2023-08-04 01:10:41,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:10:41" (3/3) ... [2023-08-04 01:10:41,165 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe031_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:10:41,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:10:41,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:10:41,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 01:10:41,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:10:41,218 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:10:41,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 01:10:41,334 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-04 01:10:41,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:10:41,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 449 events. 30/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1994 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-04 01:10:41,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-04 01:10:41,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 98 transitions, 211 flow [2023-08-04 01:10:41,347 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:10:41,352 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 01:10:41,354 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 211 flow [2023-08-04 01:10:41,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 211 flow [2023-08-04 01:10:41,388 INFO L124 PetriNetUnfolderBase]: 6/217 cut-off events. [2023-08-04 01:10:41,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:10:41,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 217 events. 6/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 653 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2023-08-04 01:10:41,391 INFO L119 LiptonReduction]: Number of co-enabled transitions 1282 [2023-08-04 01:10:43,574 INFO L134 LiptonReduction]: Checked pairs total: 3136 [2023-08-04 01:10:43,574 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 01:10:43,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:10:43,587 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;@6256c413, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:10:43,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:10:43,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:10:43,590 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 01:10:43,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:10:43,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:10:43,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 01:10:43,591 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 01:10:43,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:10:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1903056845, now seen corresponding path program 1 times [2023-08-04 01:10:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:10:43,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760241205] [2023-08-04 01:10:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:10:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:43,735 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 01:10:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:10:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760241205] [2023-08-04 01:10:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760241205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:10:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:10:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:10:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704414300] [2023-08-04 01:10:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:10:43,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:10:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:10:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:10:43,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:10:43,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 205 [2023-08-04 01:10:43,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 01:10:43,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:10:43,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 205 [2023-08-04 01:10:43,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:10:43,870 INFO L124 PetriNetUnfolderBase]: 319/618 cut-off events. [2023-08-04 01:10:43,870 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-04 01:10:43,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 618 events. 319/618 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3095 event pairs, 247 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 1234. Up to 533 conditions per place. [2023-08-04 01:10:43,875 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 21 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-04 01:10:43,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 119 flow [2023-08-04 01:10:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:10:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:10:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-04 01:10:43,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658536585365853 [2023-08-04 01:10:43,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-04 01:10:43,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-04 01:10:43,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:10:43,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-04 01:10:43,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 01:10:43,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 01:10:43,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states 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 01:10:43,894 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 348 transitions. [2023-08-04 01:10:43,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 119 flow [2023-08-04 01:10:43,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 01:10:43,897 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 01:10:43,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 01:10:43,900 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 01:10:43,900 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 01:10:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 01:10:43,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:10:43,901 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:10:43,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:10:43,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:10:43,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:10:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1895935058, now seen corresponding path program 1 times [2023-08-04 01:10:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:10:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55772972] [2023-08-04 01:10:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:10:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:10:43,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:10:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:10:43,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:10:43,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:10:43,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:10:43,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:10:43,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:10:43,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 01:10:43,943 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 01:10:43,944 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 01:10:43,944 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:10:43,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:10:43,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:10:43,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 01:10:44,097 INFO L124 PetriNetUnfolderBase]: 93/1390 cut-off events. [2023-08-04 01:10:44,097 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:10:44,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1390 events. 93/1390 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9632 event pairs, 0 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1004. Up to 54 conditions per place. [2023-08-04 01:10:44,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 01:10:44,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 280 flow [2023-08-04 01:10:44,102 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:10:44,102 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 280 flow [2023-08-04 01:10:44,102 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 280 flow [2023-08-04 01:10:44,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 280 flow [2023-08-04 01:10:44,139 INFO L124 PetriNetUnfolderBase]: 12/607 cut-off events. [2023-08-04 01:10:44,140 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:10:44,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 607 events. 12/607 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3183 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 482. Up to 27 conditions per place. [2023-08-04 01:10:44,147 INFO L119 LiptonReduction]: Number of co-enabled transitions 3564 [2023-08-04 01:10:45,976 INFO L134 LiptonReduction]: Checked pairs total: 10584 [2023-08-04 01:10:45,977 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-04 01:10:45,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:10:45,979 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;@6256c413, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:10:45,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:10:45,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:10:45,983 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-08-04 01:10:45,983 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 01:10:45,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:10:45,983 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 01:10:45,983 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 01:10:45,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:10:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -179947144, now seen corresponding path program 1 times [2023-08-04 01:10:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:10:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611140589] [2023-08-04 01:10:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:10:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:10:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:10:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611140589] [2023-08-04 01:10:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611140589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:10:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:10:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:10:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188441436] [2023-08-04 01:10:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:10:46,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:10:46,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:10:46,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:10:46,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:10:46,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 236 [2023-08-04 01:10:46,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:46,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:10:46,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 236 [2023-08-04 01:10:46,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:10:51,564 INFO L124 PetriNetUnfolderBase]: 55520/76218 cut-off events. [2023-08-04 01:10:51,564 INFO L125 PetriNetUnfolderBase]: For 4404/4404 co-relation queries the response was YES. [2023-08-04 01:10:51,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153113 conditions, 76218 events. 55520/76218 cut-off events. For 4404/4404 co-relation queries the response was YES. Maximal size of possible extension queue 2559. Compared 513462 event pairs, 44754 based on Foata normal form. 0/69704 useless extension candidates. Maximal degree in co-relation 43854. Up to 71670 conditions per place. [2023-08-04 01:10:51,983 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 34 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-04 01:10:51,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 204 flow [2023-08-04 01:10:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:10:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:10:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-04 01:10:51,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2023-08-04 01:10:51,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-04 01:10:51,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-04 01:10:51,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:10:51,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-04 01:10:51,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:51,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:51,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:51,993 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 124 flow. Second operand 3 states and 412 transitions. [2023-08-04 01:10:51,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 204 flow [2023-08-04 01:10:52,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 198 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 01:10:52,002 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 130 flow [2023-08-04 01:10:52,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-04 01:10:52,003 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2023-08-04 01:10:52,003 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 130 flow [2023-08-04 01:10:52,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:52,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:10:52,003 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:10:52,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 01:10:52,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:10:52,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:10:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1324132546, now seen corresponding path program 1 times [2023-08-04 01:10:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:10:52,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885357308] [2023-08-04 01:10:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:10:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:10:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:10:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885357308] [2023-08-04 01:10:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885357308] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:10:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169251655] [2023-08-04 01:10:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:10:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:10:52,110 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 01:10:52,111 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 01:10:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:52,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:10:52,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:10:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:10:52,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:10:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169251655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:10:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:10:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:10:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299672022] [2023-08-04 01:10:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:10:52,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:10:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:10:52,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:10:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:10:52,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 236 [2023-08-04 01:10:52,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 01:10:52,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:10:52,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 236 [2023-08-04 01:10:52,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:10:57,941 INFO L124 PetriNetUnfolderBase]: 55508/76173 cut-off events. [2023-08-04 01:10:57,942 INFO L125 PetriNetUnfolderBase]: For 3987/3987 co-relation queries the response was YES. [2023-08-04 01:10:58,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152699 conditions, 76173 events. 55508/76173 cut-off events. For 3987/3987 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 510721 event pairs, 36684 based on Foata normal form. 9/69725 useless extension candidates. Maximal degree in co-relation 54475. Up to 71623 conditions per place. [2023-08-04 01:10:58,591 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 37 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-04 01:10:58,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 226 flow [2023-08-04 01:10:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:10:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:10:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-04 01:10:58,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5610169491525424 [2023-08-04 01:10:58,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-04 01:10:58,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-04 01:10:58,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:10:58,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-04 01:10:58,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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 01:10:58,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 01:10:58,598 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 01:10:58,598 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 130 flow. Second operand 5 states and 662 transitions. [2023-08-04 01:10:58,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 226 flow [2023-08-04 01:10:58,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 52 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:10:58,599 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 144 flow [2023-08-04 01:10:58,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-04 01:10:58,600 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-04 01:10:58,600 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 144 flow [2023-08-04 01:10:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 01:10:58,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:10:58,601 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:10:58,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 01:10:58,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:10:58,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:10:58,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:10:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1257945110, now seen corresponding path program 1 times [2023-08-04 01:10:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:10:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351831255] [2023-08-04 01:10:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:58,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:10:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:10:58,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:10:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351831255] [2023-08-04 01:10:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351831255] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:10:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624079046] [2023-08-04 01:10:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:10:58,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:10:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:10:58,888 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 01:10:58,897 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 01:10:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:10:58,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:10:58,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:10:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:10:58,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:10:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624079046] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:10:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:10:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:10:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299312552] [2023-08-04 01:10:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:10:58,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:10:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:10:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:10:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:10:58,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 236 [2023-08-04 01:10:58,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:10:58,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:10:58,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 236 [2023-08-04 01:10:58,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:04,199 INFO L124 PetriNetUnfolderBase]: 53886/73656 cut-off events. [2023-08-04 01:11:04,199 INFO L125 PetriNetUnfolderBase]: For 3706/3706 co-relation queries the response was YES. [2023-08-04 01:11:04,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148107 conditions, 73656 events. 53886/73656 cut-off events. For 3706/3706 co-relation queries the response was YES. Maximal size of possible extension queue 2570. Compared 491757 event pairs, 42318 based on Foata normal form. 0/67415 useless extension candidates. Maximal degree in co-relation 42512. Up to 69144 conditions per place. [2023-08-04 01:11:04,788 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 40 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-08-04 01:11:04,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 248 flow [2023-08-04 01:11:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:11:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:11:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-04 01:11:04,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5889830508474576 [2023-08-04 01:11:04,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-04 01:11:04,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-04 01:11:04,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:04,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-04 01:11:04,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 01:11:04,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:04,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:04,812 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 144 flow. Second operand 3 states and 417 transitions. [2023-08-04 01:11:04,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 248 flow [2023-08-04 01:11:04,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 241 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 01:11:04,813 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 152 flow [2023-08-04 01:11:04,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-04 01:11:04,814 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2023-08-04 01:11:04,814 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 152 flow [2023-08-04 01:11:04,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:04,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:04,815 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:04,822 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 01:11:05,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:05,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:11:05,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 814771762, now seen corresponding path program 1 times [2023-08-04 01:11:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613653968] [2023-08-04 01:11:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:11:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613653968] [2023-08-04 01:11:05,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613653968] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:11:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962170690] [2023-08-04 01:11:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:11:05,046 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 01:11:05,048 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 01:11:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:05,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:11:05,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:11:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:11:05,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:11:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 01:11:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962170690] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:11:05,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:11:05,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:11:05,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814280750] [2023-08-04 01:11:05,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:11:05,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:11:05,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:11:05,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:11:05,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 236 [2023-08-04 01:11:05,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 01:11:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 236 [2023-08-04 01:11:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:09,082 INFO L124 PetriNetUnfolderBase]: 42343/57158 cut-off events. [2023-08-04 01:11:09,082 INFO L125 PetriNetUnfolderBase]: For 3204/3204 co-relation queries the response was YES. [2023-08-04 01:11:09,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115332 conditions, 57158 events. 42343/57158 cut-off events. For 3204/3204 co-relation queries the response was YES. Maximal size of possible extension queue 2053. Compared 360572 event pairs, 26937 based on Foata normal form. 3/52651 useless extension candidates. Maximal degree in co-relation 40989. Up to 53881 conditions per place. [2023-08-04 01:11:09,399 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 38 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-04 01:11:09,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 241 flow [2023-08-04 01:11:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:11:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:11:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-04 01:11:09,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5688559322033898 [2023-08-04 01:11:09,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-04 01:11:09,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-04 01:11:09,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:09,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-04 01:11:09,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 01:11:09,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:09,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:09,404 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 152 flow. Second operand 4 states and 537 transitions. [2023-08-04 01:11:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 241 flow [2023-08-04 01:11:09,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:11:09,407 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 147 flow [2023-08-04 01:11:09,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-04 01:11:09,410 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-04 01:11:09,410 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 147 flow [2023-08-04 01:11:09,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 01:11:09,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:09,411 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:09,429 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 01:11:09,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:09,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:11:09,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1214564335, now seen corresponding path program 1 times [2023-08-04 01:11:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:09,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212498645] [2023-08-04 01:11:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:09,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:11:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212498645] [2023-08-04 01:11:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212498645] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:11:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456832669] [2023-08-04 01:11:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:11:09,705 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 01:11:09,707 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 01:11:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:09,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:11:09,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:11:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:11:09,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:11:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456832669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:11:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:11:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 01:11:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053531449] [2023-08-04 01:11:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:11:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:11:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:11:09,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:11:09,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 236 [2023-08-04 01:11:09,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 01:11:09,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:09,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 236 [2023-08-04 01:11:09,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:13,812 INFO L124 PetriNetUnfolderBase]: 41935/56881 cut-off events. [2023-08-04 01:11:13,812 INFO L125 PetriNetUnfolderBase]: For 2671/2671 co-relation queries the response was YES. [2023-08-04 01:11:14,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114597 conditions, 56881 events. 41935/56881 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 2090. Compared 363864 event pairs, 11542 based on Foata normal form. 144/52704 useless extension candidates. Maximal degree in co-relation 40710. Up to 52515 conditions per place. [2023-08-04 01:11:14,218 INFO L140 encePairwiseOnDemand]: 232/236 looper letters, 53 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 01:11:14,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 305 flow [2023-08-04 01:11:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:11:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:11:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-04 01:11:14,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.573728813559322 [2023-08-04 01:11:14,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-04 01:11:14,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-04 01:11:14,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:14,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-04 01:11:14,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states 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 01:11:14,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 01:11:14,230 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states 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 01:11:14,230 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 147 flow. Second operand 5 states and 677 transitions. [2023-08-04 01:11:14,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 305 flow [2023-08-04 01:11:14,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 298 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:11:14,233 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 157 flow [2023-08-04 01:11:14,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-08-04 01:11:14,233 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-08-04 01:11:14,233 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 157 flow [2023-08-04 01:11:14,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 01:11:14,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:14,234 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:14,241 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 01:11:14,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:14,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:11:14,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1469631924, now seen corresponding path program 1 times [2023-08-04 01:11:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476435874] [2023-08-04 01:11:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:11:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476435874] [2023-08-04 01:11:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476435874] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:11:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003000218] [2023-08-04 01:11:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:11:14,505 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 01:11:14,507 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 01:11:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:14,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:11:14,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:11:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:11:14,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:11:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:11:14,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003000218] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:11:14,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:11:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:11:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574846894] [2023-08-04 01:11:14,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:11:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:11:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:11:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:11:14,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 236 [2023-08-04 01:11:14,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 01:11:14,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:14,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 236 [2023-08-04 01:11:14,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:18,063 INFO L124 PetriNetUnfolderBase]: 35056/47122 cut-off events. [2023-08-04 01:11:18,063 INFO L125 PetriNetUnfolderBase]: For 3061/3061 co-relation queries the response was YES. [2023-08-04 01:11:18,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95481 conditions, 47122 events. 35056/47122 cut-off events. For 3061/3061 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 290851 event pairs, 21142 based on Foata normal form. 36/43701 useless extension candidates. Maximal degree in co-relation 33851. Up to 43492 conditions per place. [2023-08-04 01:11:18,287 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 49 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-04 01:11:18,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 291 flow [2023-08-04 01:11:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:11:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:11:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-04 01:11:18,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5805084745762712 [2023-08-04 01:11:18,288 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-04 01:11:18,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-04 01:11:18,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:18,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-04 01:11:18,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 01:11:18,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:18,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:18,291 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 157 flow. Second operand 4 states and 548 transitions. [2023-08-04 01:11:18,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 291 flow [2023-08-04 01:11:18,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:11:18,293 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 150 flow [2023-08-04 01:11:18,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-04 01:11:18,293 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-08-04 01:11:18,294 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 150 flow [2023-08-04 01:11:18,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 01:11:18,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:18,294 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:18,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 01:11:18,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:18,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:11:18,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1254061510, now seen corresponding path program 1 times [2023-08-04 01:11:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022126271] [2023-08-04 01:11:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:11:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:18,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022126271] [2023-08-04 01:11:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022126271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:11:18,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:11:18,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 01:11:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363501250] [2023-08-04 01:11:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:11:18,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:11:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:11:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:11:18,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 236 [2023-08-04 01:11:18,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 01:11:18,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:18,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 236 [2023-08-04 01:11:18,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:20,414 INFO L124 PetriNetUnfolderBase]: 19096/26599 cut-off events. [2023-08-04 01:11:20,414 INFO L125 PetriNetUnfolderBase]: For 2314/2314 co-relation queries the response was YES. [2023-08-04 01:11:20,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54858 conditions, 26599 events. 19096/26599 cut-off events. For 2314/2314 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 162489 event pairs, 952 based on Foata normal form. 3600/28470 useless extension candidates. Maximal degree in co-relation 19510. Up to 20016 conditions per place. [2023-08-04 01:11:20,492 INFO L140 encePairwiseOnDemand]: 234/236 looper letters, 0 selfloop transitions, 0 changer transitions 67/67 dead transitions. [2023-08-04 01:11:20,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 310 flow [2023-08-04 01:11:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:11:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:11:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-04 01:11:20,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.590042372881356 [2023-08-04 01:11:20,494 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-04 01:11:20,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-04 01:11:20,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:20,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-04 01:11:20,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 01:11:20,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:20,496 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:20,496 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 150 flow. Second operand 4 states and 557 transitions. [2023-08-04 01:11:20,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 310 flow [2023-08-04 01:11:20,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 303 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:11:20,596 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2023-08-04 01:11:20,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2023-08-04 01:11:20,597 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-04 01:11:20,597 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2023-08-04 01:11:20,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 01:11:20,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:11:20,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:11:20,598 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:11:20,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 01:11:20,598 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:20,599 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 01:11:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 01:11:20,705 INFO L124 PetriNetUnfolderBase]: 93/1390 cut-off events. [2023-08-04 01:11:20,706 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:11:20,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1390 events. 93/1390 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9632 event pairs, 0 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1004. Up to 54 conditions per place. [2023-08-04 01:11:20,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 151 transitions, 338 flow [2023-08-04 01:11:20,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 149 transitions, 326 flow [2023-08-04 01:11:20,709 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:11:20,709 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 149 transitions, 326 flow [2023-08-04 01:11:20,709 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 149 transitions, 326 flow [2023-08-04 01:11:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 149 transitions, 326 flow [2023-08-04 01:11:20,779 INFO L124 PetriNetUnfolderBase]: 93/1386 cut-off events. [2023-08-04 01:11:20,779 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 01:11:20,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1386 events. 93/1386 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9591 event pairs, 0 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 992. Up to 54 conditions per place. [2023-08-04 01:11:20,799 INFO L119 LiptonReduction]: Number of co-enabled transitions 5924 [2023-08-04 01:11:23,297 INFO L134 LiptonReduction]: Checked pairs total: 15992 [2023-08-04 01:11:23,298 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-04 01:11:23,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:11:23,299 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;@6256c413, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:11:23,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 01:11:23,301 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:11:23,301 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-04 01:11:23,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:11:23,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:23,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 01:11:23,301 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 01:11:23,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 625281626, now seen corresponding path program 1 times [2023-08-04 01:11:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969350447] [2023-08-04 01:11:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:23,319 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 01:11:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969350447] [2023-08-04 01:11:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969350447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:11:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:11:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:11:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991052410] [2023-08-04 01:11:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:11:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:11:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:23,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:11:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:11:23,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-04 01:11:23,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:23,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:23,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-04 01:11:23,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:11:47,811 INFO L124 PetriNetUnfolderBase]: 267242/353799 cut-off events. [2023-08-04 01:11:47,811 INFO L125 PetriNetUnfolderBase]: For 4437/4437 co-relation queries the response was YES. [2023-08-04 01:11:48,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697214 conditions, 353799 events. 267242/353799 cut-off events. For 4437/4437 co-relation queries the response was YES. Maximal size of possible extension queue 9866. Compared 2489722 event pairs, 220020 based on Foata normal form. 7812/308342 useless extension candidates. Maximal degree in co-relation 200917. Up to 338076 conditions per place. [2023-08-04 01:11:49,930 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 41 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-04 01:11:49,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 220 flow [2023-08-04 01:11:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:11:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:11:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-04 01:11:49,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243445692883895 [2023-08-04 01:11:49,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-04 01:11:49,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-04 01:11:49,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:11:49,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-04 01:11:49,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:49,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:49,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:49,934 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 128 flow. Second operand 3 states and 420 transitions. [2023-08-04 01:11:49,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 220 flow [2023-08-04 01:11:49,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 53 transitions, 218 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 01:11:49,937 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 136 flow [2023-08-04 01:11:49,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-08-04 01:11:49,938 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2023-08-04 01:11:49,938 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 136 flow [2023-08-04 01:11:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:49,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:11:49,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:11:49,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 01:11:49,938 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 01:11:49,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:11:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1678155842, now seen corresponding path program 1 times [2023-08-04 01:11:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:11:49,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129418053] [2023-08-04 01:11:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:11:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:49,968 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 01:11:49,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:11:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129418053] [2023-08-04 01:11:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129418053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:11:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961072484] [2023-08-04 01:11:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:11:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:11:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:11:49,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:11:49,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 01:11:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:11:50,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:11:50,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:11:50,046 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 01:11:50,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:11:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961072484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:11:50,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:11:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:11:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282417785] [2023-08-04 01:11:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:11:50,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:11:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:11:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:11:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:11:50,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-04 01:11:50,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:11:50,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:11:50,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-04 01:11:50,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:12:13,802 INFO L124 PetriNetUnfolderBase]: 258886/341128 cut-off events. [2023-08-04 01:12:13,802 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-08-04 01:12:14,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672773 conditions, 341128 events. 258886/341128 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 9805. Compared 2386680 event pairs, 208258 based on Foata normal form. 0/293895 useless extension candidates. Maximal degree in co-relation 672736. Up to 326233 conditions per place. [2023-08-04 01:12:15,940 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 47 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 01:12:15,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 252 flow [2023-08-04 01:12:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:12:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:12:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-04 01:12:15,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.529338327091136 [2023-08-04 01:12:15,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-04 01:12:15,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-04 01:12:15,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:12:15,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-04 01:12:15,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 01:12:15,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:15,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:15,944 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 136 flow. Second operand 3 states and 424 transitions. [2023-08-04 01:12:15,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 252 flow [2023-08-04 01:12:15,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:12:15,958 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 146 flow [2023-08-04 01:12:15,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-04 01:12:15,959 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2023-08-04 01:12:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 146 flow [2023-08-04 01:12:15,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:15,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:12:15,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:12:15,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 01:12:16,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:12:16,165 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 01:12:16,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:12:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1938317380, now seen corresponding path program 1 times [2023-08-04 01:12:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:12:16,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381517537] [2023-08-04 01:12:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:12:16,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:12:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:12:16,240 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 01:12:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:12:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381517537] [2023-08-04 01:12:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381517537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:12:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44137699] [2023-08-04 01:12:16,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:12:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:12:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:12:16,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:12:16,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 01:12:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:12:16,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:12:16,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:12:16,443 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 01:12:16,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:12:16,453 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 01:12:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44137699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:12:16,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:12:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:12:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923224707] [2023-08-04 01:12:16,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:12:16,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:12:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:12:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:12:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:12:16,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 01:12:16,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:16,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:12:16,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 01:12:16,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:12:35,364 INFO L124 PetriNetUnfolderBase]: 202606/264116 cut-off events. [2023-08-04 01:12:35,364 INFO L125 PetriNetUnfolderBase]: For 2979/2979 co-relation queries the response was YES. [2023-08-04 01:12:36,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521713 conditions, 264116 events. 202606/264116 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 7826. Compared 1750454 event pairs, 135114 based on Foata normal form. 3/229342 useless extension candidates. Maximal degree in co-relation 185134. Up to 253192 conditions per place. [2023-08-04 01:12:36,882 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 45 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-08-04 01:12:36,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 260 flow [2023-08-04 01:12:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:12:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:12:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 545 transitions. [2023-08-04 01:12:36,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102996254681648 [2023-08-04 01:12:36,883 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 545 transitions. [2023-08-04 01:12:36,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 545 transitions. [2023-08-04 01:12:36,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:12:36,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 545 transitions. [2023-08-04 01:12:36,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:36,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:36,887 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:36,887 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 146 flow. Second operand 4 states and 545 transitions. [2023-08-04 01:12:36,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 260 flow [2023-08-04 01:12:36,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:12:36,889 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 158 flow [2023-08-04 01:12:36,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-04 01:12:36,890 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2023-08-04 01:12:36,890 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 158 flow [2023-08-04 01:12:36,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:36,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:12:36,891 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:12:36,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 01:12:37,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:12:37,092 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 01:12:37,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:12:37,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1265995005, now seen corresponding path program 1 times [2023-08-04 01:12:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:12:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854701610] [2023-08-04 01:12:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:12:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:12:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:12:37,164 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 01:12:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:12:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854701610] [2023-08-04 01:12:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854701610] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:12:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666085976] [2023-08-04 01:12:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:12:37,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:12:37,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:12:37,165 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 01:12:37,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 01:12:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:12:37,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:12:37,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:12:37,854 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 01:12:37,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:12:37,863 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 01:12:37,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666085976] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:12:37,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:12:37,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:12:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008653661] [2023-08-04 01:12:37,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:12:37,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:12:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:12:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:12:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:12:37,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 01:12:37,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 01:12:37,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:12:37,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 01:12:37,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:12:53,155 INFO L124 PetriNetUnfolderBase]: 168352/217750 cut-off events. [2023-08-04 01:12:53,155 INFO L125 PetriNetUnfolderBase]: For 2205/2205 co-relation queries the response was YES. [2023-08-04 01:12:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430285 conditions, 217750 events. 168352/217750 cut-off events. For 2205/2205 co-relation queries the response was YES. Maximal size of possible extension queue 7192. Compared 1409870 event pairs, 107266 based on Foata normal form. 36/189993 useless extension candidates. Maximal degree in co-relation 152428. Up to 207628 conditions per place. [2023-08-04 01:12:54,731 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 56 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2023-08-04 01:12:54,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 316 flow [2023-08-04 01:12:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:12:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:12:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-04 01:12:54,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205992509363296 [2023-08-04 01:12:54,733 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-04 01:12:54,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-04 01:12:54,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:12:54,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-04 01:12:54,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:54,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:54,735 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:54,736 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 158 flow. Second operand 4 states and 556 transitions. [2023-08-04 01:12:54,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 316 flow [2023-08-04 01:12:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 309 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:12:54,737 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 165 flow [2023-08-04 01:12:54,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2023-08-04 01:12:54,737 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-04 01:12:54,737 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 165 flow [2023-08-04 01:12:54,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 01:12:54,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:12:54,738 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:12:54,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 01:12:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 01:12:54,943 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 01:12:54,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:12:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1303878338, now seen corresponding path program 1 times [2023-08-04 01:12:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:12:54,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279430018] [2023-08-04 01:12:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:12:54,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:12:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:12:55,011 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 01:12:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:12:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279430018] [2023-08-04 01:12:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279430018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:12:55,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:12:55,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 01:12:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951478221] [2023-08-04 01:12:55,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:12:55,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:12:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:12:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:12:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:12:55,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 267 [2023-08-04 01:12:55,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:12:55,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:12:55,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 267 [2023-08-04 01:12:55,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:07,563 INFO L124 PetriNetUnfolderBase]: 144616/188263 cut-off events. [2023-08-04 01:13:07,563 INFO L125 PetriNetUnfolderBase]: For 3133/3133 co-relation queries the response was YES. [2023-08-04 01:13:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371382 conditions, 188263 events. 144616/188263 cut-off events. For 3133/3133 co-relation queries the response was YES. Maximal size of possible extension queue 6421. Compared 1209251 event pairs, 24520 based on Foata normal form. 0/167526 useless extension candidates. Maximal degree in co-relation 131610. Up to 164161 conditions per place. [2023-08-04 01:13:08,737 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-04 01:13:08,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 72 transitions, 336 flow [2023-08-04 01:13:08,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 01:13:08,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568039950062422 [2023-08-04 01:13:08,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 01:13:08,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 01:13:08,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:08,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 01:13:08,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:08,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:08,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:08,752 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 165 flow. Second operand 3 states and 446 transitions. [2023-08-04 01:13:08,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 72 transitions, 336 flow [2023-08-04 01:13:08,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 329 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:13:08,754 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 179 flow [2023-08-04 01:13:08,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-04 01:13:08,755 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2023-08-04 01:13:08,755 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 179 flow [2023-08-04 01:13:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:08,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:08,755 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 01:13:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 01:13:08,755 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 01:13:08,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1765099362, now seen corresponding path program 1 times [2023-08-04 01:13:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679746511] [2023-08-04 01:13:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:08,787 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 01:13:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679746511] [2023-08-04 01:13:08,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679746511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:08,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:08,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 01:13:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957554922] [2023-08-04 01:13:08,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:13:08,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-04 01:13:08,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 01:13:08,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:08,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-04 01:13:08,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:22,267 INFO L124 PetriNetUnfolderBase]: 142168/182071 cut-off events. [2023-08-04 01:13:22,267 INFO L125 PetriNetUnfolderBase]: For 11680/11680 co-relation queries the response was YES. [2023-08-04 01:13:22,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385342 conditions, 182071 events. 142168/182071 cut-off events. For 11680/11680 co-relation queries the response was YES. Maximal size of possible extension queue 6274. Compared 1131523 event pairs, 118120 based on Foata normal form. 0/162054 useless extension candidates. Maximal degree in co-relation 136071. Up to 173284 conditions per place. [2023-08-04 01:13:23,621 INFO L140 encePairwiseOnDemand]: 263/267 looper letters, 56 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-04 01:13:23,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 328 flow [2023-08-04 01:13:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-04 01:13:23,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380774032459426 [2023-08-04 01:13:23,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-04 01:13:23,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-04 01:13:23,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:23,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-04 01:13:23,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 01:13:23,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:23,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:23,626 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 179 flow. Second operand 3 states and 431 transitions. [2023-08-04 01:13:23,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 328 flow [2023-08-04 01:13:23,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:13:23,629 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 190 flow [2023-08-04 01:13:23,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=176, 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=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2023-08-04 01:13:23,630 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2023-08-04 01:13:23,630 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 190 flow [2023-08-04 01:13:23,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 01:13:23,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:23,631 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 01:13:23,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 01:13:23,631 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 01:13:23,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1588196855, now seen corresponding path program 1 times [2023-08-04 01:13:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483421080] [2023-08-04 01:13:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:13:23,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:13:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:13:23,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:13:23,705 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:13:23,705 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 01:13:23,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 01:13:23,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 01:13:23,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 01:13:23,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 01:13:23,706 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:23,706 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-04 01:13:23,709 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 01:13:23,709 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 01:13:23,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 01:13:23 BasicIcfg [2023-08-04 01:13:23,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 01:13:23,774 INFO L158 Benchmark]: Toolchain (without parser) took 163598.48ms. Allocated memory was 589.3MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 552.6MB in the beginning and 14.2GB in the end (delta: -13.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-04 01:13:23,774 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 406.8MB. Free memory is still 363.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 01:13:23,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.58ms. Allocated memory is still 589.3MB. Free memory was 552.6MB in the beginning and 529.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 01:13:23,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.54ms. Allocated memory is still 589.3MB. Free memory was 529.1MB in the beginning and 526.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:13:23,775 INFO L158 Benchmark]: Boogie Preprocessor took 21.92ms. Allocated memory is still 589.3MB. Free memory was 526.5MB in the beginning and 524.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:13:23,775 INFO L158 Benchmark]: RCFGBuilder took 516.72ms. Allocated memory is still 589.3MB. Free memory was 524.4MB in the beginning and 489.2MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-04 01:13:23,775 INFO L158 Benchmark]: TraceAbstraction took 162614.11ms. Allocated memory was 589.3MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 488.3MB in the beginning and 14.2GB in the end (delta: -13.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-04 01:13:23,776 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.08ms. Allocated memory is still 406.8MB. Free memory is still 363.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 408.58ms. Allocated memory is still 589.3MB. Free memory was 552.6MB in the beginning and 529.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.54ms. Allocated memory is still 589.3MB. Free memory was 529.1MB in the beginning and 526.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.92ms. Allocated memory is still 589.3MB. Free memory was 526.5MB in the beginning and 524.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 516.72ms. Allocated memory is still 589.3MB. Free memory was 524.4MB in the beginning and 489.2MB in the end (delta: 35.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 162614.11ms. Allocated memory was 589.3MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 488.3MB in the beginning and 14.2GB in the end (delta: -13.7GB). Peak memory consumption was 1.7GB. 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: 2.2s, 103 PlacesBefore, 33 PlacesAfterwards, 98 TransitionsBefore, 26 TransitionsAfterwards, 1282 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3136 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, independent: 1422, independent conditional: 0, independent unconditional: 1422, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 628, independent: 615, independent conditional: 0, independent unconditional: 615, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1546, independent: 807, independent conditional: 0, independent unconditional: 807, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 628, unknown conditional: 0, unknown unconditional: 628] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 133 PlacesBefore, 57 PlacesAfterwards, 122 TransitionsBefore, 44 TransitionsAfterwards, 3564 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 10584 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4067, independent: 3847, independent conditional: 0, independent unconditional: 3847, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1708, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4067, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1708, unknown conditional: 0, unknown unconditional: 1708] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 157 PlacesBefore, 62 PlacesAfterwards, 149 TransitionsBefore, 50 TransitionsAfterwards, 5924 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 15992 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6306, independent: 6049, independent conditional: 0, independent unconditional: 6049, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3009, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6306, independent: 3095, independent conditional: 0, independent unconditional: 3095, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 3009, unknown conditional: 0, unknown unconditional: 3009] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 282, Positive conditional cache size: 0, Positive unconditional cache size: 282, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516[2]; [L816] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t2516[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516[asdf], ((void *)0), P0, ((void *)0))=-3, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t2516[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516[asdf], ((void *)0), P0, ((void *)0))=-2, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND FALSE 0 !(asdf<2) [L817] 0 pthread_t t2517[2]; [L818] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t2517[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517[asdf], ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t2517[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517[asdf], ((void *)0), P1, ((void *)0))=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND FALSE 0 !(asdf<2) [L819] 0 pthread_t t2518[2]; [L820] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L820] COND TRUE 0 asdf<2 [L820] FCALL, FORK 0 pthread_create(&t2518[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518[asdf], ((void *)0), P2, ((void *)0))=1, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 5 y$w_buff1 = y$w_buff0 [L779] 5 y$w_buff0 = 2 [L780] 5 y$w_buff1_used = y$w_buff0_used [L781] 5 y$w_buff0_used = (_Bool)1 [L782] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L782] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L820] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L820] COND TRUE 0 asdf<2 [L820] FCALL, FORK 0 pthread_create(&t2518[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518[asdf], ((void *)0), P2, ((void *)0))=2, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 6 y$w_buff1 = y$w_buff0 [L779] 6 y$w_buff0 = 2 [L780] 6 y$w_buff1_used = y$w_buff0_used [L781] 6 y$w_buff0_used = (_Bool)1 [L782] 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, 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=2, y$w_buff0_used=1, y$w_buff1=2, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 10 procedures, 171 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: 36.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 15 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 28, 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, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 874 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 124/141 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 1 thread instances CFG has 10 procedures, 171 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: 123.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 118.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 613 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 4 mSDtfsCounter, 613 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=190occurred 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 555 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-04 01:13:23,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...