/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix010.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:04:43,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:04:43,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:04:43,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:04:43,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:04:43,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:04:43,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:04:43,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:04:43,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:04:43,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:04:43,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:04:43,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:04:43,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:04:43,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:04:43,275 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:04:43,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:04:43,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:04:43,276 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:04:43,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:04:43,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:04:43,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:04:43,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:04:43,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:04:43,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:04:43,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:04:43,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:04:43,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:04:43,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:04:43,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:04:43,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:04:43,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:43,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:04:43,280 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:04:43,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:04:43,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:04:43,281 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:04:43,281 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 -> TOGETHER [2023-08-03 17:04:43,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:04:43,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:04:43,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:04:43,527 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:04:43,529 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:04:43,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix010.opt_bound2.i [2023-08-03 17:04:44,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:04:44,956 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:04:44,957 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix010.opt_bound2.i [2023-08-03 17:04:44,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b2f80b1/c2fe471ce7a44e6b980cfc2909a28358/FLAG13f866dbf [2023-08-03 17:04:44,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87b2f80b1/c2fe471ce7a44e6b980cfc2909a28358 [2023-08-03 17:04:44,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:04:44,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:04:44,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:44,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:04:44,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:04:44,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:44" (1/1) ... [2023-08-03 17:04:44,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@923c92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:44, skipping insertion in model container [2023-08-03 17:04:44,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:04:44" (1/1) ... [2023-08-03 17:04:45,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:04:45,163 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_mix010.opt_bound2.i[944,957] [2023-08-03 17:04:45,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:45,333 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:04:45,345 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_mix010.opt_bound2.i[944,957] [2023-08-03 17:04:45,362 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:04:45,363 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:04:45,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:04:45,446 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:45,447 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:04:45,453 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:04:45,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45 WrapperNode [2023-08-03 17:04:45,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:04:45,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:45,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:04:45,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:04:45,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,533 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-03 17:04:45,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:04:45,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:04:45,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:04:45,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:04:45,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:04:45,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:04:45,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:04:45,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:04:45,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (1/1) ... [2023-08-03 17:04:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:04:45,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:04:45,622 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-03 17:04:45,646 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-03 17:04:45,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:04:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:04:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:04:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:04:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:04:45,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:04:45,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:04:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:04:45,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:04:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:04:45,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:04:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:04:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:04:45,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:04:45,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:04:45,659 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:04:45,825 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:04:45,828 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:04:46,165 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:04:46,285 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:04:46,286 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:04:46,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:46 BoogieIcfgContainer [2023-08-03 17:04:46,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:04:46,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:04:46,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:04:46,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:04:46,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:04:44" (1/3) ... [2023-08-03 17:04:46,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5370bf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:46, skipping insertion in model container [2023-08-03 17:04:46,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:04:45" (2/3) ... [2023-08-03 17:04:46,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5370bf22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:04:46, skipping insertion in model container [2023-08-03 17:04:46,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:04:46" (3/3) ... [2023-08-03 17:04:46,298 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix010.opt_bound2.i [2023-08-03 17:04:46,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:04:46,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:04:46,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:04:46,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:04:46,387 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:04:46,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,547 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 17:04:46,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2024 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2023-08-03 17:04:46,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,563 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:04:46,574 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,576 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:04:46,643 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-03 17:04:46,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:46,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2024 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2023-08-03 17:04:46,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 2742 [2023-08-03 17:04:50,241 INFO L134 LiptonReduction]: Checked pairs total: 6990 [2023-08-03 17:04:50,242 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-03 17:04:50,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:04:50,259 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;@4699cb72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:04:50,259 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:04:50,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:04:50,265 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-03 17:04:50,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:50,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:50,266 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:04:50,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:04:50,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:50,271 INFO L85 PathProgramCache]: Analyzing trace with hash 421582700, now seen corresponding path program 1 times [2023-08-03 17:04:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:50,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706971565] [2023-08-03 17:04:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:50,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:04:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:04:50,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:04:50,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:04:50,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:04:50,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:04:50,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:04:50,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:04:50,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:04:50,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:04:50,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:04:50,422 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-03 17:04:50,425 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:04:50,425 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:04:50,460 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:04:50,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,659 INFO L124 PetriNetUnfolderBase]: 93/1419 cut-off events. [2023-08-03 17:04:50,659 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:04:50,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1419 events. 93/1419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9870 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1024. Up to 54 conditions per place. [2023-08-03 17:04:50,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:04:50,671 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,672 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-03 17:04:50,815 INFO L124 PetriNetUnfolderBase]: 93/1419 cut-off events. [2023-08-03 17:04:50,815 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:04:50,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1419 events. 93/1419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9870 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1024. Up to 54 conditions per place. [2023-08-03 17:04:50,853 INFO L119 LiptonReduction]: Number of co-enabled transitions 6668 [2023-08-03 17:04:54,234 INFO L134 LiptonReduction]: Checked pairs total: 22342 [2023-08-03 17:04:54,235 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-03 17:04:54,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:04:54,237 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;@4699cb72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:04:54,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:04:54,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:04:54,241 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-03 17:04:54,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:04:54,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:04:54,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 17:04:54,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:04:54,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:04:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash 862905125, now seen corresponding path program 1 times [2023-08-03 17:04:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:04:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806948418] [2023-08-03 17:04:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:04:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:04:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:04:54,396 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-03 17:04:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:04:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806948418] [2023-08-03 17:04:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806948418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:04:54,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:04:54,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:04:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375147226] [2023-08-03 17:04:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:04:54,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:04:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:04:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:04:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:04:54,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-03 17:04:54,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:04:54,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:04:54,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-03 17:04:54,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:05:37,993 INFO L124 PetriNetUnfolderBase]: 378842/497310 cut-off events. [2023-08-03 17:05:37,994 INFO L125 PetriNetUnfolderBase]: For 5220/5220 co-relation queries the response was YES. [2023-08-03 17:05:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980351 conditions, 497310 events. 378842/497310 cut-off events. For 5220/5220 co-relation queries the response was YES. Maximal size of possible extension queue 14742. Compared 3589295 event pairs, 313476 based on Foata normal form. 10836/436692 useless extension candidates. Maximal degree in co-relation 283200. Up to 476892 conditions per place. [2023-08-03 17:05:41,192 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 43 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 17:05:41,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 244 flow [2023-08-03 17:05:41,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:05:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:05:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-03 17:05:41,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328554360812425 [2023-08-03 17:05:41,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-03 17:05:41,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-03 17:05:41,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:05:41,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-03 17:05:41,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:05:41,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:05:41,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:05:41,216 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 148 flow. Second operand 3 states and 446 transitions. [2023-08-03 17:05:41,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 244 flow [2023-08-03 17:05:41,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 59 transitions, 238 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:05:41,233 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 152 flow [2023-08-03 17:05:41,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=140, 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=152, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-03 17:05:41,238 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-03 17:05:41,238 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 152 flow [2023-08-03 17:05:41,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:05:41,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:05:41,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:05:41,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:05:41,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:05:41,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:05:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash -945449201, now seen corresponding path program 1 times [2023-08-03 17:05:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:05:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051185881] [2023-08-03 17:05:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:05:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:05:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:05:41,315 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-03 17:05:41,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:05:41,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051185881] [2023-08-03 17:05:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051185881] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:05:41,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844788272] [2023-08-03 17:05:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:05:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:05:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:05:41,319 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-03 17:05:41,324 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-03 17:05:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:05:41,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 17:05:41,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:05:41,473 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-03 17:05:41,473 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:05:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844788272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:05:41,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:05:41,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 17:05:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038427062] [2023-08-03 17:05:41,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:05:41,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:05:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:05:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:05:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:05:41,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-03 17:05:41,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:05:41,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:05:41,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-03 17:05:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:06:21,034 INFO L124 PetriNetUnfolderBase]: 366838/478471 cut-off events. [2023-08-03 17:06:21,034 INFO L125 PetriNetUnfolderBase]: For 4347/4347 co-relation queries the response was YES. [2023-08-03 17:06:22,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944759 conditions, 478471 events. 366838/478471 cut-off events. For 4347/4347 co-relation queries the response was YES. Maximal size of possible extension queue 14822. Compared 3429321 event pairs, 296770 based on Foata normal form. 0/417547 useless extension candidates. Maximal degree in co-relation 944722. Up to 460105 conditions per place. [2023-08-03 17:06:24,589 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-03 17:06:24,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 272 flow [2023-08-03 17:06:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:06:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:06:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-03 17:06:24,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-03 17:06:24,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-03 17:06:24,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-03 17:06:24,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:06:24,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-03 17:06:24,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:06:24,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:06:24,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:06:24,597 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 152 flow. Second operand 3 states and 450 transitions. [2023-08-03 17:06:24,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 272 flow [2023-08-03 17:06:24,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:06:24,600 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 162 flow [2023-08-03 17:06:24,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-08-03 17:06:24,601 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-03 17:06:24,601 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 162 flow [2023-08-03 17:06:24,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:06:24,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:06:24,601 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:06:24,608 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-03 17:06:24,808 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-03 17:06:24,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:06:24,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:06:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash 372336536, now seen corresponding path program 1 times [2023-08-03 17:06:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:06:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437750817] [2023-08-03 17:06:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:06:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:06:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:06:24,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437750817] [2023-08-03 17:06:24,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437750817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:06:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906379386] [2023-08-03 17:06:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:06:24,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:06:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:06:24,931 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-03 17:06:24,933 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-03 17:06:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:06:25,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:06:25,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:06:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:06:25,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:06:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906379386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:06:25,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:06:25,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:06:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024416228] [2023-08-03 17:06:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:06:25,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:06:25,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:06:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:06:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:06:25,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-03 17:06:25,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:06:25,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:06:25,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-03 17:06:25,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:07:04,601 INFO L124 PetriNetUnfolderBase]: 366826/478187 cut-off events. [2023-08-03 17:07:04,601 INFO L125 PetriNetUnfolderBase]: For 4683/4683 co-relation queries the response was YES. [2023-08-03 17:07:06,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945217 conditions, 478187 events. 366826/478187 cut-off events. For 4683/4683 co-relation queries the response was YES. Maximal size of possible extension queue 14959. Compared 3415283 event pairs, 257856 based on Foata normal form. 9/418448 useless extension candidates. Maximal degree in co-relation 273550. Up to 460209 conditions per place. [2023-08-03 17:07:07,980 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 47 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-03 17:07:07,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 281 flow [2023-08-03 17:07:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:07:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:07:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-08-03 17:07:07,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2023-08-03 17:07:07,983 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-08-03 17:07:07,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-08-03 17:07:07,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:07:07,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-08-03 17:07:07,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:07,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:07,989 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:07,989 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 162 flow. Second operand 5 states and 711 transitions. [2023-08-03 17:07:07,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 281 flow [2023-08-03 17:07:07,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 17:07:07,993 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 178 flow [2023-08-03 17:07:07,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-08-03 17:07:07,994 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2023-08-03 17:07:07,994 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 178 flow [2023-08-03 17:07:07,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:07,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:07:07,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:07:08,008 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-03 17:07:08,205 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-03 17:07:08,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:07:08,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:07:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 508537061, now seen corresponding path program 1 times [2023-08-03 17:07:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:07:08,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059217442] [2023-08-03 17:07:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:07:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:07:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:07:08,297 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-03 17:07:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:07:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059217442] [2023-08-03 17:07:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059217442] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:07:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525798755] [2023-08-03 17:07:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:07:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:07:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:07:08,302 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-03 17:07:08,304 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-03 17:07:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:07:08,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:07:08,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:07:08,430 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-03 17:07:08,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:07:08,445 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-03 17:07:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525798755] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:07:08,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:07:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:07:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001868031] [2023-08-03 17:07:08,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:07:08,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:07:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:07:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:07:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:07:08,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-03 17:07:08,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:08,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:07:08,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-03 17:07:08,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:07:38,477 INFO L124 PetriNetUnfolderBase]: 286798/370328 cut-off events. [2023-08-03 17:07:38,478 INFO L125 PetriNetUnfolderBase]: For 3567/3567 co-relation queries the response was YES. [2023-08-03 17:07:39,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732295 conditions, 370328 events. 286798/370328 cut-off events. For 3567/3567 co-relation queries the response was YES. Maximal size of possible extension queue 11847. Compared 2522644 event pairs, 193392 based on Foata normal form. 3/325520 useless extension candidates. Maximal degree in co-relation 259643. Up to 356836 conditions per place. [2023-08-03 17:07:40,990 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 47 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-03 17:07:40,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 63 transitions, 284 flow [2023-08-03 17:07:40,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:07:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:07:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2023-08-03 17:07:40,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517921146953405 [2023-08-03 17:07:40,993 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2023-08-03 17:07:40,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2023-08-03 17:07:40,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:07:40,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2023-08-03 17:07:40,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:40,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:40,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:40,997 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 178 flow. Second operand 4 states and 578 transitions. [2023-08-03 17:07:40,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 63 transitions, 284 flow [2023-08-03 17:07:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 63 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 17:07:41,000 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 169 flow [2023-08-03 17:07:41,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-08-03 17:07:41,001 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2023-08-03 17:07:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 169 flow [2023-08-03 17:07:41,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:41,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:07:41,002 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:07:41,009 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-03 17:07:41,206 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-03 17:07:41,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:07:41,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:07:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2073921490, now seen corresponding path program 1 times [2023-08-03 17:07:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:07:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610490272] [2023-08-03 17:07:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:07:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:07:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:07:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:07:41,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:07:41,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610490272] [2023-08-03 17:07:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610490272] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:07:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585334449] [2023-08-03 17:07:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:07:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:07:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:07:41,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:07:41,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 17:07:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:07:41,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:07:41,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:07:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:07:41,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:07:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:07:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585334449] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:07:41,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:07:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:07:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135251589] [2023-08-03 17:07:41,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:07:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:07:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:07:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:07:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:07:41,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-03 17:07:41,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:07:41,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:07:41,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-03 17:07:41,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:08:08,822 INFO L124 PetriNetUnfolderBase]: 238048/305077 cut-off events. [2023-08-03 17:08:08,823 INFO L125 PetriNetUnfolderBase]: For 2671/2671 co-relation queries the response was YES. [2023-08-03 17:08:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603465 conditions, 305077 events. 238048/305077 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 10738. Compared 2036514 event pairs, 153796 based on Foata normal form. 36/269374 useless extension candidates. Maximal degree in co-relation 213610. Up to 292876 conditions per place. [2023-08-03 17:08:11,003 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 58 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-03 17:08:11,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 331 flow [2023-08-03 17:08:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:08:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:08:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-03 17:08:11,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-03 17:08:11,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-03 17:08:11,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-03 17:08:11,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:08:11,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-03 17:08:11,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:11,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:11,009 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:11,010 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 169 flow. Second operand 4 states and 590 transitions. [2023-08-03 17:08:11,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 331 flow [2023-08-03 17:08:11,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 325 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:08:11,013 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 183 flow [2023-08-03 17:08:11,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2023-08-03 17:08:11,014 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-03 17:08:11,014 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 183 flow [2023-08-03 17:08:11,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:11,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:08:11,015 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:08:11,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 17:08:11,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:08:11,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:08:11,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:08:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 110445500, now seen corresponding path program 1 times [2023-08-03 17:08:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:08:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939857052] [2023-08-03 17:08:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:08:11,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:08:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:08:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:08:11,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:08:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939857052] [2023-08-03 17:08:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939857052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:08:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131581108] [2023-08-03 17:08:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:08:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:08:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:08:11,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:08:11,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 17:08:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:08:11,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:08:11,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:08:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:08:11,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:08:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131581108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:08:11,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:08:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 17:08:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238692317] [2023-08-03 17:08:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:08:11,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:08:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:08:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:08:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:08:11,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-03 17:08:11,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:11,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:08:11,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-03 17:08:11,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:08:36,411 INFO L124 PetriNetUnfolderBase]: 237640/304147 cut-off events. [2023-08-03 17:08:36,411 INFO L125 PetriNetUnfolderBase]: For 4069/4069 co-relation queries the response was YES. [2023-08-03 17:08:37,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602475 conditions, 304147 events. 237640/304147 cut-off events. For 4069/4069 co-relation queries the response was YES. Maximal size of possible extension queue 10703. Compared 1998346 event pairs, 107014 based on Foata normal form. 144/268354 useless extension candidates. Maximal degree in co-relation 213249. Up to 292824 conditions per place. [2023-08-03 17:08:38,601 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 62 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-08-03 17:08:38,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 349 flow [2023-08-03 17:08:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:08:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:08:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2023-08-03 17:08:38,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197132616487455 [2023-08-03 17:08:38,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2023-08-03 17:08:38,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2023-08-03 17:08:38,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:08:38,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2023-08-03 17:08:38,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:38,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:38,608 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:38,609 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 183 flow. Second operand 5 states and 725 transitions. [2023-08-03 17:08:38,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 349 flow [2023-08-03 17:08:38,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 342 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:08:38,612 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 172 flow [2023-08-03 17:08:38,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2023-08-03 17:08:38,613 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-03 17:08:38,613 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 172 flow [2023-08-03 17:08:38,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:38,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:08:38,613 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:08:38,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-03 17:08:38,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:08:38,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:08:38,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:08:38,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1236329019, now seen corresponding path program 1 times [2023-08-03 17:08:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:08:38,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959038990] [2023-08-03 17:08:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:08:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:08:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:08:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:08:38,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:08:38,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959038990] [2023-08-03 17:08:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959038990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:08:38,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:08:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:08:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925701309] [2023-08-03 17:08:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:08:38,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:08:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:08:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:08:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:08:38,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 279 [2023-08-03 17:08:38,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:08:38,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:08:38,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 279 [2023-08-03 17:08:38,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:09:00,928 INFO L124 PetriNetUnfolderBase]: 214312/275842 cut-off events. [2023-08-03 17:09:00,928 INFO L125 PetriNetUnfolderBase]: For 3574/3574 co-relation queries the response was YES. [2023-08-03 17:09:01,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544541 conditions, 275842 events. 214312/275842 cut-off events. For 3574/3574 co-relation queries the response was YES. Maximal size of possible extension queue 9924. Compared 1819710 event pairs, 39640 based on Foata normal form. 0/248518 useless extension candidates. Maximal degree in co-relation 192786. Up to 249409 conditions per place. [2023-08-03 17:09:03,006 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 61 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-03 17:09:03,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 347 flow [2023-08-03 17:09:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:09:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:09:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-03 17:09:03,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5639187574671446 [2023-08-03 17:09:03,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-03 17:09:03,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-03 17:09:03,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:09:03,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-03 17:09:03,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:03,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:03,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:03,011 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 172 flow. Second operand 3 states and 472 transitions. [2023-08-03 17:09:03,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 347 flow [2023-08-03 17:09:03,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:09:03,016 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 188 flow [2023-08-03 17:09:03,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2023-08-03 17:09:03,017 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-03 17:09:03,017 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 188 flow [2023-08-03 17:09:03,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:03,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:09:03,017 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:09:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:09:03,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:09:03,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:09:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash 328845977, now seen corresponding path program 1 times [2023-08-03 17:09:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:09:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978104662] [2023-08-03 17:09:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:09:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:09:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:09:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:09:03,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:09:03,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978104662] [2023-08-03 17:09:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978104662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:09:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:09:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:09:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688629888] [2023-08-03 17:09:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:09:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:09:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:09:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:09:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:09:03,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-03 17:09:03,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:03,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:09:03,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-03 17:09:03,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:09:28,585 INFO L124 PetriNetUnfolderBase]: 211864/269830 cut-off events. [2023-08-03 17:09:28,586 INFO L125 PetriNetUnfolderBase]: For 14272/14272 co-relation queries the response was YES. [2023-08-03 17:09:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564262 conditions, 269830 events. 211864/269830 cut-off events. For 14272/14272 co-relation queries the response was YES. Maximal size of possible extension queue 9789. Compared 1733925 event pairs, 174592 based on Foata normal form. 0/241273 useless extension candidates. Maximal degree in co-relation 199167. Up to 257980 conditions per place. [2023-08-03 17:09:30,666 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 59 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-03 17:09:30,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 345 flow [2023-08-03 17:09:30,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:09:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:09:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-03 17:09:30,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5471923536439666 [2023-08-03 17:09:30,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-03 17:09:30,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-03 17:09:30,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:09:30,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-03 17:09:30,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:30,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:30,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:30,670 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 188 flow. Second operand 3 states and 458 transitions. [2023-08-03 17:09:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 345 flow [2023-08-03 17:09:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 341 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:09:30,675 INFO L231 Difference]: Finished difference. Result has 81 places, 58 transitions, 199 flow [2023-08-03 17:09:30,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=81, PETRI_TRANSITIONS=58} [2023-08-03 17:09:30,676 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-03 17:09:30,676 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 58 transitions, 199 flow [2023-08-03 17:09:30,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:09:30,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:09:30,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:09:30,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 17:09:30,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:09:30,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:09:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash -742102303, now seen corresponding path program 1 times [2023-08-03 17:09:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:09:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789266933] [2023-08-03 17:09:30,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:09:30,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:09:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:30,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:09:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:09:30,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:09:30,724 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:09:30,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:09:30,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 17:09:30,725 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:09:30,729 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:09:30,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:09:30,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:09:30 BasicIcfg [2023-08-03 17:09:30,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:09:30,808 INFO L158 Benchmark]: Toolchain (without parser) took 285814.03ms. Allocated memory was 597.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 543.0MB in the beginning and 13.2GB in the end (delta: -12.6GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-03 17:09:30,808 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 307.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:09:30,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 597.7MB. Free memory was 542.7MB in the beginning and 518.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 17:09:30,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.41ms. Allocated memory is still 597.7MB. Free memory was 518.5MB in the beginning and 515.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:09:30,808 INFO L158 Benchmark]: Boogie Preprocessor took 47.53ms. Allocated memory is still 597.7MB. Free memory was 515.4MB in the beginning and 513.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:09:30,809 INFO L158 Benchmark]: RCFGBuilder took 705.99ms. Allocated memory is still 597.7MB. Free memory was 513.3MB in the beginning and 474.0MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-03 17:09:30,809 INFO L158 Benchmark]: TraceAbstraction took 284515.84ms. Allocated memory was 597.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 472.9MB in the beginning and 13.2GB in the end (delta: -12.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-08-03 17:09:30,811 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 360.7MB. Free memory is still 307.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 460.48ms. Allocated memory is still 597.7MB. Free memory was 542.7MB in the beginning and 518.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.41ms. Allocated memory is still 597.7MB. Free memory was 518.5MB in the beginning and 515.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.53ms. Allocated memory is still 597.7MB. Free memory was 515.4MB in the beginning and 513.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 705.99ms. Allocated memory is still 597.7MB. Free memory was 513.3MB in the beginning and 474.0MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 284515.84ms. Allocated memory was 597.7MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 472.9MB in the beginning and 13.2GB in the end (delta: -12.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 136 PlacesBefore, 41 PlacesAfterwards, 134 TransitionsBefore, 35 TransitionsAfterwards, 2742 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 115 TotalNumberOfCompositions, 6990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4019, independent: 3830, independent conditional: 0, independent unconditional: 3830, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1474, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4019, independent: 2383, independent conditional: 0, independent unconditional: 2383, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1474, unknown conditional: 0, unknown unconditional: 1474] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 168 PlacesBefore, 68 PlacesAfterwards, 160 TransitionsBefore, 56 TransitionsAfterwards, 6668 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 22342 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9004, independent: 8637, independent conditional: 0, independent unconditional: 8637, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3417, independent: 3352, independent conditional: 0, independent unconditional: 3352, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9004, independent: 5285, independent conditional: 0, independent unconditional: 5285, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 3417, unknown conditional: 0, unknown unconditional: 3417] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 410, Positive conditional cache size: 0, Positive unconditional cache size: 410, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260[2]; [L854] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t260[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260[asdf], ((void *)0), P0, ((void *)0))=-5, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t260[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260[asdf], ((void *)0), P0, ((void *)0))=-4, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND FALSE 0 !(asdf<2) [L855] 0 pthread_t t261[2]; [L856] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t261[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261[asdf], ((void *)0), P1, ((void *)0))=-3, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t261[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261[asdf], ((void *)0), P1, ((void *)0))=-2, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND FALSE 0 !(asdf<2) [L857] 0 pthread_t t262[2]; [L858] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t262[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262[asdf], ((void *)0), P2, ((void *)0))=-1, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 5 z$w_buff1 = z$w_buff0 [L801] 5 z$w_buff0 = 1 [L802] 5 z$w_buff1_used = z$w_buff0_used [L803] 5 z$w_buff0_used = (_Bool)1 [L804] CALL 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L804] RET 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 5 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 5 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 5 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 5 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 5 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t262[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262[asdf], ((void *)0), P2, ((void *)0))=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 6 z$w_buff1 = z$w_buff0 [L801] 6 z$w_buff0 = 1 [L802] 6 z$w_buff1_used = z$w_buff0_used [L803] 6 z$w_buff0_used = (_Bool)1 [L804] CALL 6 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 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: 4.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 0, 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 with 2 thread instances CFG has 10 procedures, 182 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: 280.3s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 273.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 18 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=8, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 80/97 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-03 17:09:30,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...