/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:34:20,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:34:20,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:34:20,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:34:20,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:34:20,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:34:20,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:34:20,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:34:20,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:34:20,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:34:20,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:34:20,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:34:20,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:34:20,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:34:20,225 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:34:20,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:34:20,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:34:20,225 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:34:20,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:34:20,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:34:20,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:34:20,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:34:20,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:34:20,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:34:20,228 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:34:20,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:34:20,228 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:34:20,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:34:20,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:34:20,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:34:20,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:34:20,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:34:20,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:34:20,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:34:20,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:34:20,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:34:20,231 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 06:34:20,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:34:20,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:34:20,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:34:20,510 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:34:20,510 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:34:20,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 06:34:21,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:34:21,953 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:34:21,953 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 06:34:21,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/197f02c6d/ed7c56f567434d25afb6e0c79d37b6d0/FLAGc142906d8 [2023-08-04 06:34:21,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/197f02c6d/ed7c56f567434d25afb6e0c79d37b6d0 [2023-08-04 06:34:21,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:34:21,987 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:34:21,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:34:21,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:34:21,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:34:21,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:34:21" (1/1) ... [2023-08-04 06:34:21,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dd98e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:21, skipping insertion in model container [2023-08-04 06:34:21,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:34:21" (1/1) ... [2023-08-04 06:34:22,058 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:34:22,232 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_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i[970,983] [2023-08-04 06:34:22,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:34:22,465 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:34:22,477 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_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i[970,983] [2023-08-04 06:34:22,496 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:34:22,498 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:34:22,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:34:22,586 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:34:22,586 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:34:22,592 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:34:22,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22 WrapperNode [2023-08-04 06:34:22,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:34:22,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:34:22,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:34:22,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:34:22,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,672 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-04 06:34:22,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:34:22,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:34:22,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:34:22,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:34:22,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:34:22,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:34:22,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:34:22,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:34:22,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (1/1) ... [2023-08-04 06:34:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:34:22,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:22,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 06:34:22,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:34:22,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:34:22,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:34:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:34:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:34:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:34:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:34:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:34:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:34:22,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:34:22,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:34:22,813 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 06:34:22,969 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:34:22,971 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:34:23,392 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:34:23,555 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:34:23,556 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:34:23,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:34:23 BoogieIcfgContainer [2023-08-04 06:34:23,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:34:23,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:34:23,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:34:23,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:34:23,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:34:21" (1/3) ... [2023-08-04 06:34:23,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb7c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:34:23, skipping insertion in model container [2023-08-04 06:34:23,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:34:22" (2/3) ... [2023-08-04 06:34:23,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cb7c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:34:23, skipping insertion in model container [2023-08-04 06:34:23,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:34:23" (3/3) ... [2023-08-04 06:34:23,577 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe004_power.oepc_pso.oepc_rmo.oepc_bound2.i [2023-08-04 06:34:23,584 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:34:23,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:34:23,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:34:23,594 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:34:23,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:34:23,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,815 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:34:23,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:23,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1974 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:34:23,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,834 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:23,846 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,850 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:23,929 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:34:23,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:23,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1974 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:34:23,938 INFO L119 LiptonReduction]: Number of co-enabled transitions 2728 [2023-08-04 06:34:27,416 INFO L134 LiptonReduction]: Checked pairs total: 6841 [2023-08-04 06:34:27,416 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-04 06:34:27,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:34:27,433 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;@689ff5e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:27,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:34:27,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:27,437 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-04 06:34:27,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:27,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:27,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:34:27,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:27,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 19300067, now seen corresponding path program 1 times [2023-08-04 06:34:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477386730] [2023-08-04 06:34:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:27,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477386730] [2023-08-04 06:34:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477386730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:34:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712388578] [2023-08-04 06:34:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:27,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:27,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 237 [2023-08-04 06:34:27,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:27,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:27,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 237 [2023-08-04 06:34:27,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:28,565 INFO L124 PetriNetUnfolderBase]: 2468/4196 cut-off events. [2023-08-04 06:34:28,566 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-04 06:34:28,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8159 conditions, 4196 events. 2468/4196 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 26530 event pairs, 650 based on Foata normal form. 150/3860 useless extension candidates. Maximal degree in co-relation 6897. Up to 2665 conditions per place. [2023-08-04 06:34:28,591 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 44 selfloop transitions, 2 changer transitions 8/56 dead transitions. [2023-08-04 06:34:28,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 235 flow [2023-08-04 06:34:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-04 06:34:28,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358649789029536 [2023-08-04 06:34:28,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-04 06:34:28,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-04 06:34:28,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:28,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-04 06:34:28,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 06:34:28,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:28,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:28,628 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 85 flow. Second operand 3 states and 381 transitions. [2023-08-04 06:34:28,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 235 flow [2023-08-04 06:34:28,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 235 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:34:28,634 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 69 flow [2023-08-04 06:34:28,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 06:34:28,641 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 06:34:28,642 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 69 flow [2023-08-04 06:34:28,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:28,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:28,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:28,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:34:28,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:28,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -392333397, now seen corresponding path program 1 times [2023-08-04 06:34:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662319388] [2023-08-04 06:34:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662319388] [2023-08-04 06:34:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662319388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:28,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:34:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102371480] [2023-08-04 06:34:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:28,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-04 06:34:28,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:28,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:28,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-04 06:34:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:29,103 INFO L124 PetriNetUnfolderBase]: 1659/2582 cut-off events. [2023-08-04 06:34:29,103 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2023-08-04 06:34:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5410 conditions, 2582 events. 1659/2582 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13061 event pairs, 996 based on Foata normal form. 0/2426 useless extension candidates. Maximal degree in co-relation 5395. Up to 2544 conditions per place. [2023-08-04 06:34:29,116 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 27 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 06:34:29,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 139 flow [2023-08-04 06:34:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-04 06:34:29,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908579465541491 [2023-08-04 06:34:29,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-04 06:34:29,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-04 06:34:29,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:29,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-04 06:34:29,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,128 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 69 flow. Second operand 3 states and 349 transitions. [2023-08-04 06:34:29,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 139 flow [2023-08-04 06:34:29,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:29,133 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 73 flow [2023-08-04 06:34:29,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-04 06:34:29,134 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-04 06:34:29,134 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 73 flow [2023-08-04 06:34:29,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:29,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 06:34:29,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:29,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1696969515, now seen corresponding path program 1 times [2023-08-04 06:34:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:29,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630913631] [2023-08-04 06:34:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630913631] [2023-08-04 06:34:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630913631] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278680885] [2023-08-04 06:34:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:29,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:29,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:29,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:34:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:29,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:34:29,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:29,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:34:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278680885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:34:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:34:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941226465] [2023-08-04 06:34:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:29,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:29,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-04 06:34:29,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:29,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-04 06:34:29,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:29,692 INFO L124 PetriNetUnfolderBase]: 1440/2171 cut-off events. [2023-08-04 06:34:29,692 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:34:29,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4399 conditions, 2171 events. 1440/2171 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10442 event pairs, 906 based on Foata normal form. 0/2058 useless extension candidates. Maximal degree in co-relation 4383. Up to 2125 conditions per place. [2023-08-04 06:34:29,706 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 30 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 06:34:29,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 153 flow [2023-08-04 06:34:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-04 06:34:29,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49507735583684953 [2023-08-04 06:34:29,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-04 06:34:29,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-04 06:34:29,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:29,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-04 06:34:29,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,711 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 73 flow. Second operand 3 states and 352 transitions. [2023-08-04 06:34:29,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 153 flow [2023-08-04 06:34:29,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:29,712 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 77 flow [2023-08-04 06:34:29,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-04 06:34:29,713 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-04 06:34:29,714 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 77 flow [2023-08-04 06:34:29,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:29,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:29,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:29,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:34:29,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:29,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:29,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash -328020585, now seen corresponding path program 1 times [2023-08-04 06:34:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:29,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181929211] [2023-08-04 06:34:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181929211] [2023-08-04 06:34:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181929211] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116356182] [2023-08-04 06:34:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:29,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:29,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:30,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:34:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:30,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:34:30,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:30,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:34:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116356182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:34:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:34:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835312381] [2023-08-04 06:34:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:30,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-04 06:34:30,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:30,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-04 06:34:30,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:30,479 INFO L124 PetriNetUnfolderBase]: 1344/2019 cut-off events. [2023-08-04 06:34:30,479 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 06:34:30,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 2019 events. 1344/2019 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9339 event pairs, 792 based on Foata normal form. 0/1938 useless extension candidates. Maximal degree in co-relation 4119. Up to 1727 conditions per place. [2023-08-04 06:34:30,491 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 34 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2023-08-04 06:34:30,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 173 flow [2023-08-04 06:34:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-04 06:34:30,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007032348804501 [2023-08-04 06:34:30,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-04 06:34:30,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-04 06:34:30,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:30,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-04 06:34:30,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,496 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 77 flow. Second operand 3 states and 356 transitions. [2023-08-04 06:34:30,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 173 flow [2023-08-04 06:34:30,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:30,498 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 81 flow [2023-08-04 06:34:30,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-04 06:34:30,499 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-04 06:34:30,499 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 81 flow [2023-08-04 06:34:30,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:30,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:30,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 06:34:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 06:34:30,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:30,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1746637322, now seen corresponding path program 1 times [2023-08-04 06:34:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381037841] [2023-08-04 06:34:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381037841] [2023-08-04 06:34:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381037841] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415013750] [2023-08-04 06:34:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:30,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:30,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:34:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:30,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:34:30,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:30,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:34:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415013750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:34:30,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:34:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:34:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348866221] [2023-08-04 06:34:30,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:34:30,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:34:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:34:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:30,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-04 06:34:30,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:30,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-04 06:34:30,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:30,984 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 06:34:30,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 06:34:30,984 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 06:34:30,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 06:34:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:34:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:34:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-04 06:34:30,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45569620253164556 [2023-08-04 06:34:30,986 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-04 06:34:30,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-04 06:34:30,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:30,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-04 06:34:30,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,990 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 81 flow. Second operand 4 states and 432 transitions. [2023-08-04 06:34:30,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 06:34:30,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:34:30,990 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 06:34:30,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 06:34:30,991 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -22 predicate places. [2023-08-04 06:34:30,991 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 06:34:30,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:30,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:34:30,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:34:30,994 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:34:31,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:34:31,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:31,200 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:34:31,202 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:34:31,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:31,239 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:34:31,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:31,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1974 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:34:31,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:34:31,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 99 transitions, 213 flow [2023-08-04 06:34:31,242 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:31,242 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 99 transitions, 213 flow [2023-08-04 06:34:31,242 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 99 transitions, 213 flow [2023-08-04 06:34:31,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 213 flow [2023-08-04 06:34:31,257 INFO L124 PetriNetUnfolderBase]: 6/215 cut-off events. [2023-08-04 06:34:31,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:31,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 215 events. 6/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 639 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. [2023-08-04 06:34:31,260 INFO L119 LiptonReduction]: Number of co-enabled transitions 1452 [2023-08-04 06:34:33,860 INFO L134 LiptonReduction]: Checked pairs total: 3682 [2023-08-04 06:34:33,861 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 06:34:33,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:34:33,863 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;@689ff5e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:33,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:34:33,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:33,866 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:34:33,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:33,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:33,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:34:33,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:34:33,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2023-08-04 06:34:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432033373] [2023-08-04 06:34:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:33,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432033373] [2023-08-04 06:34:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432033373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:34:33,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651502439] [2023-08-04 06:34:33,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:33,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:33,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 206 [2023-08-04 06:34:33,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:33,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:33,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 206 [2023-08-04 06:34:33,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:34,045 INFO L124 PetriNetUnfolderBase]: 579/1017 cut-off events. [2023-08-04 06:34:34,045 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-04 06:34:34,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1017 events. 579/1017 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4929 event pairs, 295 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 2052. Up to 935 conditions per place. [2023-08-04 06:34:34,051 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 06:34:34,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 133 flow [2023-08-04 06:34:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 06:34:34,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5598705501618123 [2023-08-04 06:34:34,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 06:34:34,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 06:34:34,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:34,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 06:34:34,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:34,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:34,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:34,056 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 346 transitions. [2023-08-04 06:34:34,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 133 flow [2023-08-04 06:34:34,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 133 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:34:34,059 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 06:34:34,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 06:34:34,060 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 06:34:34,061 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 06:34:34,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:34,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:34,061 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:34:34,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:34:34,061 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 06:34:34,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -616665389, now seen corresponding path program 1 times [2023-08-04 06:34:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:34,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700277627] [2023-08-04 06:34:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:34:34,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:34:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:34:34,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:34:34,106 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:34:34,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:34:34,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:34:34,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:34:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:34:34,107 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:34:34,109 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:34:34,110 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:34:34,110 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:34:34,146 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:34:34,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,284 INFO L124 PetriNetUnfolderBase]: 93/1376 cut-off events. [2023-08-04 06:34:34,284 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:34:34,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1376 events. 93/1376 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9473 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 999. Up to 54 conditions per place. [2023-08-04 06:34:34,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,296 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:34,296 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,296 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:34:34,422 INFO L124 PetriNetUnfolderBase]: 93/1376 cut-off events. [2023-08-04 06:34:34,422 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:34:34,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1376 events. 93/1376 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9473 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 999. Up to 54 conditions per place. [2023-08-04 06:34:34,454 INFO L119 LiptonReduction]: Number of co-enabled transitions 6560 [2023-08-04 06:34:37,943 INFO L134 LiptonReduction]: Checked pairs total: 19129 [2023-08-04 06:34:37,943 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-04 06:34:37,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:34:37,945 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;@689ff5e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:37,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:34:37,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:37,948 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 06:34:37,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:37,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:37,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:34:37,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:34:37,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 30683253, now seen corresponding path program 1 times [2023-08-04 06:34:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907780180] [2023-08-04 06:34:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:38,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907780180] [2023-08-04 06:34:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907780180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:34:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801800601] [2023-08-04 06:34:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:38,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:38,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 267 [2023-08-04 06:34:38,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:38,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:38,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 267 [2023-08-04 06:34:38,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:36:00,972 INFO L124 PetriNetUnfolderBase]: 633758/829591 cut-off events. [2023-08-04 06:36:00,972 INFO L125 PetriNetUnfolderBase]: For 9581/9581 co-relation queries the response was YES. [2023-08-04 06:36:03,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633196 conditions, 829591 events. 633758/829591 cut-off events. For 9581/9581 co-relation queries the response was YES. Maximal size of possible extension queue 19669. Compared 6129763 event pairs, 105203 based on Foata normal form. 17577/758072 useless extension candidates. Maximal degree in co-relation 1376151. Up to 729279 conditions per place. [2023-08-04 06:36:06,536 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 75 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-08-04 06:36:06,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 389 flow [2023-08-04 06:36:06,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:36:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:36:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-04 06:36:06,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5667915106117354 [2023-08-04 06:36:06,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-04 06:36:06,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-04 06:36:06,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:36:06,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-04 06:36:06,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:06,541 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 06:36:06,542 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 06:36:06,542 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 144 flow. Second operand 3 states and 454 transitions. [2023-08-04 06:36:06,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 389 flow [2023-08-04 06:36:06,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 88 transitions, 383 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 06:36:06,558 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 157 flow [2023-08-04 06:36:06,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-04 06:36:06,559 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 06:36:06,559 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 157 flow [2023-08-04 06:36:06,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:06,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:36:06,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:36:06,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:36:06,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:36:06,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:36:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash -256173517, now seen corresponding path program 1 times [2023-08-04 06:36:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:36:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385874705] [2023-08-04 06:36:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:36:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:36:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:36:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:36:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:36:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385874705] [2023-08-04 06:36:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385874705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:36:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:36:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:36:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082624314] [2023-08-04 06:36:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:36:06,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:36:06,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:36:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:36:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:36:06,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 267 [2023-08-04 06:36:06,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:06,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:36:06,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 267 [2023-08-04 06:36:06,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:37:28,641 INFO L124 PetriNetUnfolderBase]: 618374/780803 cut-off events. [2023-08-04 06:37:28,641 INFO L125 PetriNetUnfolderBase]: For 61758/61758 co-relation queries the response was YES. [2023-08-04 06:37:31,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670432 conditions, 780803 events. 618374/780803 cut-off events. For 61758/61758 co-relation queries the response was YES. Maximal size of possible extension queue 17707. Compared 5074732 event pairs, 518026 based on Foata normal form. 0/692563 useless extension candidates. Maximal degree in co-relation 1099253. Up to 771849 conditions per place. [2023-08-04 06:37:33,633 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 48 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 06:37:33,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 270 flow [2023-08-04 06:37:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:37:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:37:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-04 06:37:33,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5143570536828964 [2023-08-04 06:37:33,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-04 06:37:33,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-04 06:37:33,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:37:33,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-04 06:37:33,637 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 06:37:33,638 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 06:37:33,639 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 06:37:33,639 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 157 flow. Second operand 3 states and 412 transitions. [2023-08-04 06:37:33,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 270 flow [2023-08-04 06:37:33,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:37:33,735 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 166 flow [2023-08-04 06:37:33,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-04 06:37:33,735 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 06:37:33,735 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 166 flow [2023-08-04 06:37:33,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:37:33,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:37:33,736 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:37:33,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:37:33,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:37:33,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:37:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -569844496, now seen corresponding path program 1 times [2023-08-04 06:37:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:37:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095838046] [2023-08-04 06:37:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:37:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:37:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:37:33,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:37:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:37:33,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:37:33,767 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:37:33,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:37:33,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:37:33,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:37:33,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:37:33,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:37:33,768 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:37:33,768 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:37:33,769 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:37:33,769 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:37:33,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:37:33 BasicIcfg [2023-08-04 06:37:33,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:37:33,820 INFO L158 Benchmark]: Toolchain (without parser) took 191833.16ms. Allocated memory was 348.1MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 296.0MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 6.3GB. Max. memory is 16.0GB. [2023-08-04 06:37:33,820 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory is still 297.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:37:33,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.99ms. Allocated memory is still 348.1MB. Free memory was 295.7MB in the beginning and 269.8MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 06:37:33,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.71ms. Allocated memory is still 348.1MB. Free memory was 269.8MB in the beginning and 267.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:37:33,821 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 348.1MB. Free memory was 267.0MB in the beginning and 264.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:37:33,821 INFO L158 Benchmark]: RCFGBuilder took 821.83ms. Allocated memory was 348.1MB in the beginning and 528.5MB in the end (delta: 180.4MB). Free memory was 264.6MB in the beginning and 452.5MB in the end (delta: -187.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.0GB. [2023-08-04 06:37:33,822 INFO L158 Benchmark]: TraceAbstraction took 190247.68ms. Allocated memory was 528.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 451.5MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-04 06:37:33,823 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory is still 297.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 604.99ms. Allocated memory is still 348.1MB. Free memory was 295.7MB in the beginning and 269.8MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.71ms. Allocated memory is still 348.1MB. Free memory was 269.8MB in the beginning and 267.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 348.1MB. Free memory was 267.0MB in the beginning and 264.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 821.83ms. Allocated memory was 348.1MB in the beginning and 528.5MB in the end (delta: 180.4MB). Free memory was 264.6MB in the beginning and 452.5MB in the end (delta: -187.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.0GB. * TraceAbstraction took 190247.68ms. Allocated memory was 528.5MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 451.5MB in the beginning and 9.7GB in the end (delta: -9.2GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 130 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 2728 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 109 TotalNumberOfCompositions, 6841 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2725, independent: 2561, independent conditional: 0, independent unconditional: 2561, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1370, independent: 1339, independent conditional: 0, independent unconditional: 1339, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2725, independent: 1222, independent conditional: 0, independent unconditional: 1222, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1370, unknown conditional: 0, unknown unconditional: 1370] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 104 PlacesBefore, 34 PlacesAfterwards, 99 TransitionsBefore, 27 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3682 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2070, independent: 1943, independent conditional: 0, independent unconditional: 1943, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 753, independent: 735, independent conditional: 0, independent unconditional: 735, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2070, independent: 1208, independent conditional: 0, independent unconditional: 1208, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 753, unknown conditional: 0, unknown unconditional: 753] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 161 PlacesBefore, 66 PlacesAfterwards, 153 TransitionsBefore, 54 TransitionsAfterwards, 6560 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 19129 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5961, independent: 5672, independent conditional: 0, independent unconditional: 5672, dependent: 289, dependent conditional: 0, dependent unconditional: 289, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3023, independent: 2966, independent conditional: 0, independent unconditional: 2966, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5961, independent: 2706, independent conditional: 0, independent unconditional: 2706, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 3023, unknown conditional: 0, unknown unconditional: 3023] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873[2]; [L845] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={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] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t1873[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873[asdf], ((void *)0), P0, ((void *)0))=-1, t1873={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] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1873={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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t1873[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873[asdf], ((void *)0), P0, ((void *)0))=0, t1873={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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 2 y$w_buff1 = y$w_buff0 [L742] 2 y$w_buff0 = 2 [L743] 2 y$w_buff1_used = y$w_buff0_used [L744] 2 y$w_buff0_used = (_Bool)1 [L745] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=2, y$w_buff1_used=1, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 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: 7.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 269 IncrementalHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 5 mSDtfsCounter, 269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 16, 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.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 174 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: 179.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 175.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 2 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 149 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.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 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=77occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:37:33,846 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...