/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_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:48:15,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:48:15,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:48:15,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:48:15,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:48:15,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:48:15,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:48:15,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:48:15,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:48:15,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:48:15,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:48:15,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:48:15,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:48:15,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:48:15,475 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:48:15,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:48:15,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:48:15,475 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:48:15,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:48:15,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:48:15,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:48:15,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:48:15,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:48:15,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:48:15,477 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:48:15,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:48:15,478 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:48:15,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:48:15,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:48:15,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:48:15,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:48:15,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:48:15,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:48:15,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:48:15,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:48:15,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:48:15,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:48:15,481 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:48:15,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:48:15,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:48:15,481 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:48:15,481 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:48:15,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:48:15,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:48:15,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:48:15,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:48:15,694 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:48:15,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:48:16,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:48:17,074 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:48:17,075 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:48:17,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec73bf2/f87e55d07e6f4c48863941caf0b3fe73/FLAGe4c5af024 [2023-08-03 17:48:17,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec73bf2/f87e55d07e6f4c48863941caf0b3fe73 [2023-08-03 17:48:17,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:48:17,108 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:48:17,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:48:17,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:48:17,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:48:17,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f460837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17, skipping insertion in model container [2023-08-03 17:48:17,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,148 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:48:17,280 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_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[1035,1048] [2023-08-03 17:48:17,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:48:17,509 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:48:17,519 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_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[1035,1048] [2023-08-03 17:48:17,539 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:48:17,541 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:48:17,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:48:17,630 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:48:17,630 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:48:17,636 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:48:17,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17 WrapperNode [2023-08-03 17:48:17,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:48:17,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:48:17,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:48:17,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:48:17,644 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:48:17" (1/1) ... [2023-08-03 17:48:17,674 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:48:17" (1/1) ... [2023-08-03 17:48:17,696 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-03 17:48:17,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:48:17,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:48:17,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:48:17,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:48:17,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:48:17,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:48:17,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:48:17,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:48:17,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (1/1) ... [2023-08-03 17:48:17,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:48:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:48:17,766 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:48:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:48:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:48:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:48:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:48:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:48:17,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:48:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:48:17,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:48:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:48:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:48:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:48:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:48:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:48:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:48:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:48:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:48:17,798 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:48:17,911 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:48:17,913 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:48:18,253 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:48:18,389 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:48:18,389 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:48:18,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:48:18 BoogieIcfgContainer [2023-08-03 17:48:18,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:48:18,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:48:18,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:48:18,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:48:18,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:48:17" (1/3) ... [2023-08-03 17:48:18,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed770c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:48:18, skipping insertion in model container [2023-08-03 17:48:18,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:48:17" (2/3) ... [2023-08-03 17:48:18,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed770c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:48:18, skipping insertion in model container [2023-08-03 17:48:18,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:48:18" (3/3) ... [2023-08-03 17:48:18,404 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:48:18,412 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:48:18,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:48:18,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:48:18,421 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:48:18,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:48:18,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,679 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-03 17:48:18,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:48:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1947 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-03 17:48:18,687 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,698 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:48:18,709 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-03 17:48:18,765 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-03 17:48:18,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:48:18,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1947 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-03 17:48:18,773 INFO L119 LiptonReduction]: Number of co-enabled transitions 2556 [2023-08-03 17:48:21,975 INFO L134 LiptonReduction]: Checked pairs total: 6224 [2023-08-03 17:48:21,976 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-03 17:48:21,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:48:21,993 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;@540fdf2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:48:21,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:48:21,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:48:21,997 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:48:21,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:48:21,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:48:21,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:48:21,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:48:22,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:48:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 558408210, now seen corresponding path program 1 times [2023-08-03 17:48:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:48:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765155828] [2023-08-03 17:48:22,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:48:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:48:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:48:22,279 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:48:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:48:22,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765155828] [2023-08-03 17:48:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765155828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:48:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:48:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:48:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488901917] [2023-08-03 17:48:22,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:48:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:48:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:48:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:48:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:48:22,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-08-03 17:48:22,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:48:22,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:48:22,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-08-03 17:48:22,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:48:22,967 INFO L124 PetriNetUnfolderBase]: 2582/4000 cut-off events. [2023-08-03 17:48:22,968 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-03 17:48:22,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 4000 events. 2582/4000 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 20673 event pairs, 1592 based on Foata normal form. 140/3488 useless extension candidates. Maximal degree in co-relation 8014. Up to 3903 conditions per place. [2023-08-03 17:48:22,992 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-03 17:48:22,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 155 flow [2023-08-03 17:48:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:48:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:48:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-03 17:48:23,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504881450488145 [2023-08-03 17:48:23,012 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-03 17:48:23,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-03 17:48:23,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:48:23,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-03 17:48:23,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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:48:23,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:48:23,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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:48:23,025 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 83 flow. Second operand 3 states and 362 transitions. [2023-08-03 17:48:23,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 155 flow [2023-08-03 17:48:23,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 155 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:48:23,029 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2023-08-03 17:48:23,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-03 17:48:23,033 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-03 17:48:23,034 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 89 flow [2023-08-03 17:48:23,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:48:23,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:48:23,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:48:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:48:23,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:48:23,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:48:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 118545203, now seen corresponding path program 1 times [2023-08-03 17:48:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:48:23,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067796748] [2023-08-03 17:48:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:48:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:48:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:48:23,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:48:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:48:23,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:48:23,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:48:23,115 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:48:23,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:48:23,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:48:23,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:48:23,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:48:23,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:48:23,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:48:23,119 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:48:23,123 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:48:23,123 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:48:23,158 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:48:23,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,328 INFO L124 PetriNetUnfolderBase]: 93/1368 cut-off events. [2023-08-03 17:48:23,329 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:48:23,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1368 events. 93/1368 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9382 event pairs, 0 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 1000. Up to 54 conditions per place. [2023-08-03 17:48:23,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,340 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:48:23,340 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,341 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-03 17:48:23,469 INFO L124 PetriNetUnfolderBase]: 93/1368 cut-off events. [2023-08-03 17:48:23,469 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:48:23,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1368 events. 93/1368 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9382 event pairs, 0 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 1000. Up to 54 conditions per place. [2023-08-03 17:48:23,502 INFO L119 LiptonReduction]: Number of co-enabled transitions 6120 [2023-08-03 17:48:26,853 INFO L134 LiptonReduction]: Checked pairs total: 17169 [2023-08-03 17:48:26,854 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-03 17:48:26,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:48:26,857 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;@540fdf2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:48:26,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:48:26,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:48:26,860 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-08-03 17:48:26,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:48:26,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:48:26,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:48:26,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:48:26,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:48:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 839009157, now seen corresponding path program 1 times [2023-08-03 17:48:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:48:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075478355] [2023-08-03 17:48:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:48:26,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:48:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:48:26,942 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:48:26,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:48:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075478355] [2023-08-03 17:48:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075478355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:48:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:48:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:48:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481487218] [2023-08-03 17:48:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:48:26,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:48:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:48:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:48:26,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:48:26,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 270 [2023-08-03 17:48:26,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:48:26,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:48:26,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 270 [2023-08-03 17:48:26,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:49:38,907 INFO L124 PetriNetUnfolderBase]: 665470/846521 cut-off events. [2023-08-03 17:49:38,907 INFO L125 PetriNetUnfolderBase]: For 12160/12160 co-relation queries the response was YES. [2023-08-03 17:49:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690723 conditions, 846521 events. 665470/846521 cut-off events. For 12160/12160 co-relation queries the response was YES. Maximal size of possible extension queue 16619. Compared 5412633 event pairs, 542248 based on Foata normal form. 18060/755081 useless extension candidates. Maximal degree in co-relation 364417. Up to 829767 conditions per place. [2023-08-03 17:49:43,928 INFO L140 encePairwiseOnDemand]: 266/270 looper letters, 46 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-03 17:49:43,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 244 flow [2023-08-03 17:49:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:49:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:49:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-03 17:49:43,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209876543209877 [2023-08-03 17:49:43,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-03 17:49:43,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-03 17:49:43,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:49:43,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-03 17:49:43,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:49:43,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:49:43,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:49:43,939 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 140 flow. Second operand 3 states and 422 transitions. [2023-08-03 17:49:43,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 244 flow [2023-08-03 17:49:43,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 56 transitions, 238 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:49:43,964 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 144 flow [2023-08-03 17:49:43,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-03 17:49:43,965 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-03 17:49:43,965 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 144 flow [2023-08-03 17:49:43,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:49:43,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:49:43,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:49:43,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:49:43,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:49:43,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:49:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -35968997, now seen corresponding path program 1 times [2023-08-03 17:49:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:49:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757591470] [2023-08-03 17:49:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:49:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:44,032 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:49:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:49:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757591470] [2023-08-03 17:49:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757591470] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:49:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425328329] [2023-08-03 17:49:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:49:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:49:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:49:44,039 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:49:44,044 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:49:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:49:44,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:49:44,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:49:44,193 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:49:44,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:49:44,212 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:49:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425328329] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:49:44,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:49:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:49:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251318308] [2023-08-03 17:49:44,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:49:44,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:49:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:49:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:49:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:49:44,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-03 17:49:44,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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:49:44,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:49:44,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-03 17:49:44,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:50:43,987 INFO L124 PetriNetUnfolderBase]: 552098/697049 cut-off events. [2023-08-03 17:50:43,988 INFO L125 PetriNetUnfolderBase]: For 8888/8888 co-relation queries the response was YES. [2023-08-03 17:50:46,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391406 conditions, 697049 events. 552098/697049 cut-off events. For 8888/8888 co-relation queries the response was YES. Maximal size of possible extension queue 14262. Compared 4286099 event pairs, 354956 based on Foata normal form. 4/609485 useless extension candidates. Maximal degree in co-relation 364272. Up to 683465 conditions per place. [2023-08-03 17:50:48,319 INFO L140 encePairwiseOnDemand]: 266/270 looper letters, 51 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-03 17:50:48,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 276 flow [2023-08-03 17:50:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:50:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:50:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-03 17:50:48,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074074074074074 [2023-08-03 17:50:48,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-03 17:50:48,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-03 17:50:48,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:50:48,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-03 17:50:48,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:50:48,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 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:50:48,327 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 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:50:48,327 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 144 flow. Second operand 4 states and 548 transitions. [2023-08-03 17:50:48,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 276 flow [2023-08-03 17:50:48,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:50:48,329 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 162 flow [2023-08-03 17:50:48,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 17:50:48,330 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 17:50:48,330 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 162 flow [2023-08-03 17:50:48,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 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:50:48,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:50:48,331 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:50:48,342 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:50:48,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:50:48,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:50:48,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:50:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash -433942013, now seen corresponding path program 1 times [2023-08-03 17:50:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:50:48,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635536605] [2023-08-03 17:50:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:50:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:50:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:50:48,637 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:50:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:50:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635536605] [2023-08-03 17:50:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635536605] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:50:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013934733] [2023-08-03 17:50:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:50:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:50:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:50:48,640 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:50:48,642 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:50:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:50:48,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:50:48,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:50:48,743 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:50:48,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:50:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013934733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:50:48,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:50:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:50:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562331108] [2023-08-03 17:50:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:50:48,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:50:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:50:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:50:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:50:48,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-03 17:50:48,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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:50:48,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:50:48,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-03 17:50:48,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:51:50,243 INFO L124 PetriNetUnfolderBase]: 552074/697005 cut-off events. [2023-08-03 17:51:50,243 INFO L125 PetriNetUnfolderBase]: For 8988/8988 co-relation queries the response was YES. [2023-08-03 17:51:52,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391374 conditions, 697005 events. 552074/697005 cut-off events. For 8988/8988 co-relation queries the response was YES. Maximal size of possible extension queue 14262. Compared 4285615 event pairs, 354944 based on Foata normal form. 16/609453 useless extension candidates. Maximal degree in co-relation 364249. Up to 683464 conditions per place. [2023-08-03 17:51:54,594 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 51 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-03 17:51:54,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 282 flow [2023-08-03 17:51:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:51:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:51:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-03 17:51:54,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2023-08-03 17:51:54,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-03 17:51:54,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-03 17:51:54,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:51:54,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-03 17:51:54,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 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:51:54,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 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:51:54,602 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 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:51:54,602 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 162 flow. Second operand 5 states and 670 transitions. [2023-08-03 17:51:54,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 282 flow [2023-08-03 17:51:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 275 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:51:54,606 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 151 flow [2023-08-03 17:51:54,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-03 17:51:54,607 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 17:51:54,607 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 151 flow [2023-08-03 17:51:54,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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:51:54,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:51:54,608 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:51:54,620 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:51:54,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:51:54,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:51:54,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:51:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -406188814, now seen corresponding path program 1 times [2023-08-03 17:51:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:51:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857647060] [2023-08-03 17:51:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:51:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:51:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:51:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:51:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:51:55,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857647060] [2023-08-03 17:51:55,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857647060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:51:55,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:51:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:51:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268106276] [2023-08-03 17:51:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:51:55,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:51:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:51:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:51:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:51:55,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 270 [2023-08-03 17:51:55,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:51:55,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:51:55,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 270 [2023-08-03 17:51:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:52:51,477 INFO L124 PetriNetUnfolderBase]: 497802/641949 cut-off events. [2023-08-03 17:52:51,477 INFO L125 PetriNetUnfolderBase]: For 8338/8338 co-relation queries the response was YES. [2023-08-03 17:52:53,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268289 conditions, 641949 events. 497802/641949 cut-off events. For 8338/8338 co-relation queries the response was YES. Maximal size of possible extension queue 13579. Compared 4220666 event pairs, 79722 based on Foata normal form. 0/577517 useless extension candidates. Maximal degree in co-relation 331949. Up to 583105 conditions per place. [2023-08-03 17:52:55,285 INFO L140 encePairwiseOnDemand]: 265/270 looper letters, 69 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-03 17:52:55,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 364 flow [2023-08-03 17:52:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:52:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:52:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-03 17:52:55,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604938271604938 [2023-08-03 17:52:55,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-03 17:52:55,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-03 17:52:55,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:52:55,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-03 17:52:55,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:52:55,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:52:55,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:52:55,290 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 151 flow. Second operand 3 states and 454 transitions. [2023-08-03 17:52:55,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 364 flow [2023-08-03 17:52:55,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 359 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:52:55,292 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 167 flow [2023-08-03 17:52:55,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 17:52:55,293 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 17:52:55,293 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 167 flow [2023-08-03 17:52:55,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:52:55,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:52:55,293 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:52:55,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:52:55,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:52:55,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:52:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 505071415, now seen corresponding path program 1 times [2023-08-03 17:52:55,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:52:55,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932161784] [2023-08-03 17:52:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:52:55,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:52:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:52:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:52:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:52:55,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932161784] [2023-08-03 17:52:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932161784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:52:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:52:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:52:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269581876] [2023-08-03 17:52:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:52:55,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:52:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:52:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:52:55,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:52:55,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 270 [2023-08-03 17:52:55,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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:52:55,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:52:55,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 270 [2023-08-03 17:52:55,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:53:52,624 INFO L124 PetriNetUnfolderBase]: 489642/612509 cut-off events. [2023-08-03 17:53:52,624 INFO L125 PetriNetUnfolderBase]: For 40902/40902 co-relation queries the response was YES. [2023-08-03 17:53:55,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296606 conditions, 612509 events. 489642/612509 cut-off events. For 40902/40902 co-relation queries the response was YES. Maximal size of possible extension queue 13398. Compared 3672103 event pairs, 407026 based on Foata normal form. 0/547581 useless extension candidates. Maximal degree in co-relation 338653. Up to 605569 conditions per place. [2023-08-03 17:53:57,805 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 56 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-03 17:53:57,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 310 flow [2023-08-03 17:53:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:53:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:53:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-03 17:53:57,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2023-08-03 17:53:57,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-03 17:53:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-03 17:53:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:53:57,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-03 17:53:57,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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:53:57,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:53:57,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 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:53:57,809 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 167 flow. Second operand 3 states and 428 transitions. [2023-08-03 17:53:57,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 310 flow [2023-08-03 17:53:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:53:57,896 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 176 flow [2023-08-03 17:53:57,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-03 17:53:57,897 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-03 17:53:57,897 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 176 flow [2023-08-03 17:53:57,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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:53:57,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:53:57,897 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:53:57,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:53:57,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:53:57,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:53:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1543668755, now seen corresponding path program 1 times [2023-08-03 17:53:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:53:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163983410] [2023-08-03 17:53:57,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:53:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:53:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:53:57,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:53:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:53:57,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:53:57,938 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:53:57,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:53:57,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:53:57,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:53:57,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:53:57,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:53:57,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:53:57,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:53:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:53:57,939 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:53:57,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:53:57,944 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:53:58,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:53:58 BasicIcfg [2023-08-03 17:53:58,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:53:58,005 INFO L158 Benchmark]: Toolchain (without parser) took 340897.53ms. Allocated memory was 503.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 445.5MB in the beginning and 10.7GB in the end (delta: -10.3GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-03 17:53:58,005 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 343.9MB. Free memory was 288.7MB in the beginning and 288.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:53:58,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.71ms. Allocated memory is still 503.3MB. Free memory was 445.1MB in the beginning and 420.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:53:58,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.44ms. Allocated memory is still 503.3MB. Free memory was 420.7MB in the beginning and 417.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:53:58,011 INFO L158 Benchmark]: Boogie Preprocessor took 33.50ms. Allocated memory is still 503.3MB. Free memory was 417.9MB in the beginning and 415.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:53:58,011 INFO L158 Benchmark]: RCFGBuilder took 662.70ms. Allocated memory is still 503.3MB. Free memory was 415.8MB in the beginning and 438.3MB in the end (delta: -22.6MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. [2023-08-03 17:53:58,012 INFO L158 Benchmark]: TraceAbstraction took 339608.18ms. Allocated memory was 503.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 437.3MB in the beginning and 10.7GB in the end (delta: -10.3GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. [2023-08-03 17:53:58,013 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 343.9MB. Free memory was 288.7MB in the beginning and 288.6MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 528.71ms. Allocated memory is still 503.3MB. Free memory was 445.1MB in the beginning and 420.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.44ms. Allocated memory is still 503.3MB. Free memory was 420.7MB in the beginning and 417.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.50ms. Allocated memory is still 503.3MB. Free memory was 417.9MB in the beginning and 415.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 662.70ms. Allocated memory is still 503.3MB. Free memory was 415.8MB in the beginning and 438.3MB in the end (delta: -22.6MB). Peak memory consumption was 23.2MB. Max. memory is 16.0GB. * TraceAbstraction took 339608.18ms. Allocated memory was 503.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 437.3MB in the beginning and 10.7GB in the end (delta: -10.3GB). Peak memory consumption was 5.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 131 PlacesBefore, 40 PlacesAfterwards, 129 TransitionsBefore, 34 TransitionsAfterwards, 2556 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 6224 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2829, independent: 2675, independent conditional: 0, independent unconditional: 2675, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1287, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2829, independent: 1415, independent conditional: 0, independent unconditional: 1415, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1287, unknown conditional: 0, unknown unconditional: 1287] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 161 PlacesBefore, 64 PlacesAfterwards, 153 TransitionsBefore, 52 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 17169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6725, independent: 6461, independent conditional: 0, independent unconditional: 6461, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3022, independent: 2964, independent conditional: 0, independent unconditional: 2964, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6725, independent: 3497, independent conditional: 0, independent unconditional: 3497, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 3022, unknown conditional: 0, unknown unconditional: 3022] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 246, Positive conditional cache size: 0, Positive unconditional cache size: 246, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740[2]; [L845] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t1740[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740[asdf], ((void *)0), P0, ((void *)0))=-4, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t1740[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740[asdf], ((void *)0), P0, ((void *)0))=-3, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L845] COND FALSE 0 !(asdf<2) [L846] 0 pthread_t t1741[2]; [L847] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t1741[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741[asdf], ((void *)0), P1, ((void *)0))=-2, t1740={5:0}, t1741={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 1 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L847] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t1741[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741[asdf], ((void *)0), P1, ((void *)0))=-1, t1740={5:0}, t1741={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 4 y$w_buff1 = y$w_buff0 [L775] 4 y$w_buff0 = 1 [L776] 4 y$w_buff1_used = y$w_buff0_used [L777] 4 y$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0] - UnprovableResult [Line: 19]: 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: 845]: 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: 847]: 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: 849]: 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, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 173 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: 334.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 329.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 511 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 9 mSDtfsCounter, 511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 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:53:58,032 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...