/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:20:51,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:20:51,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:20:51,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:20:51,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:20:51,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:20:51,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:20:51,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:20:51,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:20:51,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:20:51,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:20:51,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:20:51,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:20:51,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:20:51,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:20:51,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:20:51,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:20:51,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:20:51,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:20:51,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:20:51,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:20:51,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:20:51,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:20:51,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:20:51,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:20:51,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:20:51,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:20:51,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:20:51,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:20:51,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:20:51,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:20:51,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:20:51,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:20:51,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:20:51,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:20:51,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:20:51,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:20:51,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:20:51,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:20:51,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:20:51,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:20:51,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:20:51,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:20:51,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:20:51,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:20:51,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:20:51,739 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:20:51,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:20:51,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:20:51,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:20:51,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:20:51,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:20:51,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:20:51,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:20:51,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:20:51,741 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:20:51,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:51,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:20:51,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:20:51,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:20:51,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:20:51,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:20:51,743 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:20:51,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 23:20:52,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:20:52,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:20:52,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:20:52,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:20:52,071 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:20:52,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:20:53,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:20:53,340 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:20:53,340 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:20:53,365 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7bdb405/54b2ee6dbdb646b2bce3c75497442f2c/FLAG098b15104 [2022-12-05 23:20:53,374 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7bdb405/54b2ee6dbdb646b2bce3c75497442f2c [2022-12-05 23:20:53,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:20:53,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:20:53,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:53,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:20:53,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:20:53,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102059df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53, skipping insertion in model container [2022-12-05 23:20:53,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:20:53,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:20:53,509 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:20:53,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:53,621 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:20:53,628 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 23:20:53,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:53,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:53,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:53,677 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:20:53,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53 WrapperNode [2022-12-05 23:20:53,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:53,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:53,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:20:53,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:20:53,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,705 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2022-12-05 23:20:53,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:53,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:20:53,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:20:53,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:20:53,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:20:53,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:20:53,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:20:53,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:20:53,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (1/1) ... [2022-12-05 23:20:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:53,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:20:53,745 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) [2022-12-05 23:20:53,749 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 [2022-12-05 23:20:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:20:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:20:53,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:20:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:20:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:20:53,781 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:20:53,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:20:53,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:20:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:20:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:20:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:20:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:20:53,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:20:53,785 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:20:53,913 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:20:53,914 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:20:54,179 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:20:54,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:20:54,297 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:20:54,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:54 BoogieIcfgContainer [2022-12-05 23:20:54,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:20:54,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:20:54,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:20:54,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:20:54,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:20:53" (1/3) ... [2022-12-05 23:20:54,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a0abba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:54, skipping insertion in model container [2022-12-05 23:20:54,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:53" (2/3) ... [2022-12-05 23:20:54,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a0abba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:54, skipping insertion in model container [2022-12-05 23:20:54,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:54" (3/3) ... [2022-12-05 23:20:54,307 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 23:20:54,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:20:54,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:20:54,323 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:20:54,370 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:20:54,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:20:54,457 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:20:54,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:54,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-05 23:20:54,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-05 23:20:54,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-05 23:20:54,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:54,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:20:54,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-05 23:20:54,497 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-05 23:20:54,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:54,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-05 23:20:54,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-05 23:20:54,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 936 [2022-12-05 23:20:56,982 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-05 23:20:56,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:20:57,002 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@1d542f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:20:57,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:20:57,006 INFO L130 PetriNetUnfolder]: 1/9 cut-off events. [2022-12-05 23:20:57,006 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:57,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:57,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:20:57,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 373439099, now seen corresponding path program 1 times [2022-12-05 23:20:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:57,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127740012] [2022-12-05 23:20:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:57,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127740012] [2022-12-05 23:20:57,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127740012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:57,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:57,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788608945] [2022-12-05 23:20:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:57,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:57,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:57,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 23:20:57,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-05 23:20:57,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:57,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 23:20:57,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:57,468 INFO L130 PetriNetUnfolder]: 135/264 cut-off events. [2022-12-05 23:20:57,468 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:20:57,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 264 events. 135/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1021 event pairs, 21 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 508. Up to 187 conditions per place. [2022-12-05 23:20:57,483 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 17 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-05 23:20:57,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 100 flow [2022-12-05 23:20:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-05 23:20:57,493 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-05 23:20:57,494 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 44 flow. Second operand 3 states and 31 transitions. [2022-12-05 23:20:57,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 100 flow [2022-12-05 23:20:57,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:57,499 INFO L231 Difference]: Finished difference. Result has 23 places, 14 transitions, 36 flow [2022-12-05 23:20:57,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=23, PETRI_TRANSITIONS=14} [2022-12-05 23:20:57,503 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2022-12-05 23:20:57,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:57,504 INFO L89 Accepts]: Start accepts. Operand has 23 places, 14 transitions, 36 flow [2022-12-05 23:20:57,506 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:57,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:57,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 14 transitions, 36 flow [2022-12-05 23:20:57,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 14 transitions, 36 flow [2022-12-05 23:20:57,517 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-05 23:20:57,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:20:57,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 14 transitions, 36 flow [2022-12-05 23:20:57,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:20:57,570 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:57,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-05 23:20:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 36 flow [2022-12-05 23:20:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-05 23:20:57,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:57,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:20:57,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1902278240, now seen corresponding path program 1 times [2022-12-05 23:20:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479811636] [2022-12-05 23:20:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:57,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:57,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479811636] [2022-12-05 23:20:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479811636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:57,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:57,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730420686] [2022-12-05 23:20:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:57,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:57,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 23:20:57,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 36 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-12-05 23:20:57,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:57,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 23:20:57,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:57,814 INFO L130 PetriNetUnfolder]: 107/194 cut-off events. [2022-12-05 23:20:57,814 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:20:57,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 194 events. 107/194 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 614 event pairs, 41 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 407. Up to 184 conditions per place. [2022-12-05 23:20:57,817 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-05 23:20:57,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 21 transitions, 96 flow [2022-12-05 23:20:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-05 23:20:57,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 23:20:57,819 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 36 flow. Second operand 3 states and 22 transitions. [2022-12-05 23:20:57,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 21 transitions, 96 flow [2022-12-05 23:20:57,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:57,821 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2022-12-05 23:20:57,821 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -3 predicate places. [2022-12-05 23:20:57,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:57,822 INFO L89 Accepts]: Start accepts. Operand has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,822 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:57,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:57,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,826 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-05 23:20:57,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:57,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 24 events. 3/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 1 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 35. Up to 10 conditions per place. [2022-12-05 23:20:57,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 23:20:57,850 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:57,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-05 23:20:57,851 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 16 transitions, 51 flow [2022-12-05 23:20:57,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-12-05 23:20:57,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:57,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:57,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:20:57,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1158914833, now seen corresponding path program 1 times [2022-12-05 23:20:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:57,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829936016] [2022-12-05 23:20:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:58,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829936016] [2022-12-05 23:20:58,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829936016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:58,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:58,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130919342] [2022-12-05 23:20:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:58,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:58,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:58,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:20:58,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:20:58,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:58,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:20:58,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:58,096 INFO L130 PetriNetUnfolder]: 55/124 cut-off events. [2022-12-05 23:20:58,096 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:20:58,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 124 events. 55/124 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 399 event pairs, 11 based on Foata normal form. 19/142 useless extension candidates. Maximal degree in co-relation 282. Up to 57 conditions per place. [2022-12-05 23:20:58,097 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 19 selfloop transitions, 3 changer transitions 14/38 dead transitions. [2022-12-05 23:20:58,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 38 transitions, 178 flow [2022-12-05 23:20:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-05 23:20:58,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-05 23:20:58,100 INFO L175 Difference]: Start difference. First operand has 22 places, 16 transitions, 51 flow. Second operand 5 states and 41 transitions. [2022-12-05 23:20:58,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 38 transitions, 178 flow [2022-12-05 23:20:58,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:58,103 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 75 flow [2022-12-05 23:20:58,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2022-12-05 23:20:58,107 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-05 23:20:58,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:58,107 INFO L89 Accepts]: Start accepts. Operand has 28 places, 18 transitions, 75 flow [2022-12-05 23:20:58,108 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:58,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:58,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 18 transitions, 75 flow [2022-12-05 23:20:58,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 75 flow [2022-12-05 23:20:58,113 INFO L130 PetriNetUnfolder]: 9/38 cut-off events. [2022-12-05 23:20:58,113 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:20:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 38 events. 9/38 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 4 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 81. Up to 15 conditions per place. [2022-12-05 23:20:58,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 75 flow [2022-12-05 23:20:58,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-05 23:20:58,132 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:58,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-05 23:20:58,133 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 75 flow [2022-12-05 23:20:58,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:20:58,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:58,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:58,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:20:58,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:58,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash 304254507, now seen corresponding path program 1 times [2022-12-05 23:20:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:58,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699044900] [2022-12-05 23:20:58,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:58,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699044900] [2022-12-05 23:20:58,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699044900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:58,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:58,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830066457] [2022-12-05 23:20:58,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:58,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:58,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:58,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:58,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:20:58,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-12-05 23:20:58,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:58,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:20:58,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:58,315 INFO L130 PetriNetUnfolder]: 21/59 cut-off events. [2022-12-05 23:20:58,315 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:20:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 59 events. 21/59 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 7 based on Foata normal form. 7/66 useless extension candidates. Maximal degree in co-relation 165. Up to 25 conditions per place. [2022-12-05 23:20:58,315 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 17 selfloop transitions, 5 changer transitions 7/31 dead transitions. [2022-12-05 23:20:58,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 175 flow [2022-12-05 23:20:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:20:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:20:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-05 23:20:58,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 23:20:58,317 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 75 flow. Second operand 6 states and 36 transitions. [2022-12-05 23:20:58,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 175 flow [2022-12-05 23:20:58,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 160 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:58,318 INFO L231 Difference]: Finished difference. Result has 32 places, 18 transitions, 84 flow [2022-12-05 23:20:58,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=18} [2022-12-05 23:20:58,318 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-12-05 23:20:58,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:58,318 INFO L89 Accepts]: Start accepts. Operand has 32 places, 18 transitions, 84 flow [2022-12-05 23:20:58,319 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:58,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:58,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 18 transitions, 84 flow [2022-12-05 23:20:58,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 84 flow [2022-12-05 23:20:58,322 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-05 23:20:58,322 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:20:58,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 20 events. 2/20 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 43. Up to 7 conditions per place. [2022-12-05 23:20:58,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 84 flow [2022-12-05 23:20:58,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-05 23:20:58,683 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:20:58,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 365 [2022-12-05 23:20:58,684 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 80 flow [2022-12-05 23:20:58,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-12-05 23:20:58,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:58,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:58,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:20:58,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 115280415, now seen corresponding path program 1 times [2022-12-05 23:20:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:58,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265115635] [2022-12-05 23:20:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:58,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265115635] [2022-12-05 23:20:58,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265115635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:58,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:58,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246342488] [2022-12-05 23:20:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:58,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:20:58,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 80 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-05 23:20:58,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:58,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:20:58,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:58,858 INFO L130 PetriNetUnfolder]: 21/60 cut-off events. [2022-12-05 23:20:58,858 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-05 23:20:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 60 events. 21/60 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 180. Up to 41 conditions per place. [2022-12-05 23:20:58,859 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 17 selfloop transitions, 5 changer transitions 3/25 dead transitions. [2022-12-05 23:20:58,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 170 flow [2022-12-05 23:20:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-05 23:20:58,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:20:58,860 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 80 flow. Second operand 3 states and 21 transitions. [2022-12-05 23:20:58,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 170 flow [2022-12-05 23:20:58,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 146 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 23:20:58,862 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-12-05 23:20:58,864 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2022-12-05 23:20:58,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:58,864 INFO L89 Accepts]: Start accepts. Operand has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,865 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:58,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:58,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,869 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-05 23:20:58,869 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:20:58,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 26 events. 3/26 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2022-12-05 23:20:58,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-05 23:20:58,873 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:58,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 23:20:58,875 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 85 flow [2022-12-05 23:20:58,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2022-12-05 23:20:58,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:58,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:20:58,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1500873703, now seen corresponding path program 2 times [2022-12-05 23:20:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:58,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953658455] [2022-12-05 23:20:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:59,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953658455] [2022-12-05 23:20:59,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953658455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:59,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:59,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33146208] [2022-12-05 23:20:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:59,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:59,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:20:59,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 85 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:20:59,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:59,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:20:59,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:59,039 INFO L130 PetriNetUnfolder]: 22/67 cut-off events. [2022-12-05 23:20:59,039 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-05 23:20:59,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 67 events. 22/67 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 193 event pairs, 3 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 220. Up to 38 conditions per place. [2022-12-05 23:20:59,040 INFO L137 encePairwiseOnDemand]: 8/12 looper letters, 13 selfloop transitions, 3 changer transitions 9/25 dead transitions. [2022-12-05 23:20:59,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 165 flow [2022-12-05 23:20:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-12-05 23:20:59,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:20:59,041 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 85 flow. Second operand 4 states and 22 transitions. [2022-12-05 23:20:59,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 165 flow [2022-12-05 23:20:59,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:59,042 INFO L231 Difference]: Finished difference. Result has 29 places, 14 transitions, 74 flow [2022-12-05 23:20:59,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=14} [2022-12-05 23:20:59,042 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 4 predicate places. [2022-12-05 23:20:59,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:59,043 INFO L89 Accepts]: Start accepts. Operand has 29 places, 14 transitions, 74 flow [2022-12-05 23:20:59,043 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:59,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:59,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 14 transitions, 74 flow [2022-12-05 23:20:59,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 14 transitions, 74 flow [2022-12-05 23:20:59,046 INFO L130 PetriNetUnfolder]: 1/14 cut-off events. [2022-12-05 23:20:59,046 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:20:59,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 14 events. 1/14 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2022-12-05 23:20:59,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 14 transitions, 74 flow [2022-12-05 23:20:59,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-05 23:20:59,423 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:20:59,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 381 [2022-12-05 23:20:59,424 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 12 transitions, 68 flow [2022-12-05 23:20:59,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-12-05 23:20:59,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:59,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:59,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:20:59,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:20:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1550676938, now seen corresponding path program 1 times [2022-12-05 23:20:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:59,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526058821] [2022-12-05 23:20:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526058821] [2022-12-05 23:20:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526058821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:59,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194943196] [2022-12-05 23:20:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:59,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:59,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-05 23:20:59,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 12 transitions, 68 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-12-05 23:20:59,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:59,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-05 23:20:59,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:59,709 INFO L130 PetriNetUnfolder]: 4/22 cut-off events. [2022-12-05 23:20:59,709 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-05 23:20:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 22 events. 4/22 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 2 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2022-12-05 23:20:59,709 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 9 selfloop transitions, 3 changer transitions 6/18 dead transitions. [2022-12-05 23:20:59,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 18 transitions, 135 flow [2022-12-05 23:20:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-05 23:20:59,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-05 23:20:59,710 INFO L175 Difference]: Start difference. First operand has 27 places, 12 transitions, 68 flow. Second operand 5 states and 15 transitions. [2022-12-05 23:20:59,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 18 transitions, 135 flow [2022-12-05 23:20:59,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 111 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-05 23:20:59,711 INFO L231 Difference]: Finished difference. Result has 26 places, 12 transitions, 62 flow [2022-12-05 23:20:59,711 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=12} [2022-12-05 23:20:59,711 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2022-12-05 23:20:59,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:59,712 INFO L89 Accepts]: Start accepts. Operand has 26 places, 12 transitions, 62 flow [2022-12-05 23:20:59,712 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:59,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:59,712 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 12 transitions, 62 flow [2022-12-05 23:20:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 12 transitions, 62 flow [2022-12-05 23:20:59,714 INFO L130 PetriNetUnfolder]: 1/12 cut-off events. [2022-12-05 23:20:59,714 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:20:59,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 12 events. 1/12 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-05 23:20:59,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 12 transitions, 62 flow [2022-12-05 23:20:59,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-05 23:20:59,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L779: Formula: (and (= v_~x$r_buff0_thd2~0_114 1) (= v_~x$w_buff0_used~0_294 v_~x$w_buff1_used~0_257) (= v_~x$r_buff0_thd0~0_106 v_~x$r_buff1_thd0~0_110) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~x$w_buff0~0_212 v_~x$w_buff1~0_181) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_143) (= v_~y~0_60 1) (= v_~x$w_buff0~0_211 1) (= v_~x$w_buff0_used~0_293 1) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_115) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_31| |v_P1Thread1of1ForFork0_~arg#1.offset_31|) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_293 256) 0)) (not (= (mod v_~x$w_buff1_used~0_257 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= |v_P1Thread1of1ForFork0_~arg#1.base_31| |v_P1Thread1of1ForFork0_#in~arg#1.base_31|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_212, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_211, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_31|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_181, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_257, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_143, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_110, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_31|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [369] $Ultimate##0-->L756: Formula: (let ((.cse11 (= (mod v_~x$r_buff1_thd1~0_146 256) 0)) (.cse2 (= (mod v_~x$r_buff0_thd1~0_144 256) 0))) (let ((.cse5 (not .cse2)) (.cse9 (and .cse2 (= (mod v_~x$w_buff1_used~0_260 256) 0))) (.cse12 (= (mod v_~x$w_buff0_used~0_298 256) 0)) (.cse3 (and .cse11 .cse2))) (let ((.cse7 (or .cse9 .cse12 .cse3)) (.cse8 (and .cse5 (not .cse12)))) (let ((.cse4 (= (mod v_~x$w_buff0_used~0_297 256) 0)) (.cse1 (= (mod v_~x$w_buff1_used~0_259 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_84 256) 0))) (.cse6 (ite .cse7 v_~x~0_203 (ite .cse8 v_~x$w_buff0~0_216 v_~x$w_buff1~0_184)))) (and (= v_~x$w_buff0~0_216 v_~x$w_buff0~0_215) (= v_~x$r_buff0_thd1~0_143 (ite .cse0 v_~x$r_buff0_thd1~0_144 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_144 (ite (and (not .cse4) .cse5) 0 v_~x$r_buff0_thd1~0_144)))) (= v_~x$mem_tmp~0_68 v_~x~0_203) (= .cse6 v_~__unbuffered_p0_EAX~0_84) (= v_~x$flush_delayed~0_77 0) (= v_~y~0_62 2) (= (ite .cse0 v_~x$w_buff0_used~0_298 (ite .cse7 v_~x$w_buff0_used~0_298 (ite .cse8 0 v_~x$w_buff0_used~0_298))) v_~x$w_buff0_used~0_297) (= v_~x$w_buff1~0_184 v_~x$w_buff1~0_183) (= |v_P0Thread1of1ForFork1_#t~nondet4_82| v_~weak$$choice2~0_84) (= |v_P0Thread1of1ForFork1_#t~nondet3_82| v_~weak$$choice0~0_57) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= (ite .cse0 v_~x$w_buff1_used~0_260 (ite (or .cse9 .cse3 .cse4) v_~x$w_buff1_used~0_260 0)) v_~x$w_buff1_used~0_259) (= v_~x$r_buff1_thd1~0_145 (ite .cse0 v_~x$r_buff1_thd1~0_146 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_143 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse10 .cse1))) v_~x$r_buff1_thd1~0_146 0))) (= (ite .cse0 v_~x$mem_tmp~0_68 .cse6) v_~x~0_202) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_216, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_184, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_82|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_203, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_82|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_298} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_215, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_183, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_259, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_145, ~x$mem_tmp~0=v_~x$mem_tmp~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_297, ~weak$$choice0~0=v_~weak$$choice0~0_57, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~y~0=v_~y~0_62, ~x~0=v_~x~0_202} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-05 23:21:00,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] $Ultimate##0-->L756: Formula: (let ((.cse8 (= (mod v_~x$w_buff0_used~0_315 256) 0)) (.cse1 (= (mod v_~x$r_buff0_thd1~0_156 256) 0))) (let ((.cse2 (and .cse8 .cse1))) (let ((.cse9 (or .cse1 .cse2)) (.cse7 (not .cse1))) (let ((.cse5 (= (mod v_~x$w_buff1_used~0_275 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_313 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse6 (ite .cse9 v_~x~0_219 (ite .cse7 1 v_~x$w_buff1~0_195)))) (and (= (ite .cse0 v_~x$w_buff0_used~0_315 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff0_used~0_315 0)) v_~x$w_buff1_used~0_275) (= (ite .cse0 v_~x$r_buff0_thd1~0_156 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_155 256) 0))) (or (and .cse4 .cse1) (and .cse4 .cse5) .cse3)) v_~x$r_buff0_thd1~0_156 0)) v_~x$r_buff1_thd1~0_157) (= .cse6 v_~__unbuffered_p0_EAX~0_90) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~x$r_buff0_thd0~0_108 v_~x$r_buff1_thd0~0_112) (= (ite .cse0 v_~x$r_buff0_thd1~0_156 (ite (or (and .cse1 .cse5) .cse1 .cse3) v_~x$r_buff0_thd1~0_156 (ite (and .cse7 (not .cse3)) 0 v_~x$r_buff0_thd1~0_156))) v_~x$r_buff0_thd1~0_155) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| 0)) (= |v_P0Thread1of1ForFork1_#t~nondet4_94| v_~weak$$choice2~0_90) (= v_~x$flush_delayed~0_83 0) (= v_~x$mem_tmp~0_74 v_~x~0_219) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= v_~x$w_buff0~0_227 1) (= |v_P0Thread1of1ForFork1_#t~nondet3_94| v_~weak$$choice0~0_63) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= (ite .cse8 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|) (= (ite .cse0 1 (ite .cse9 1 (ite .cse7 0 1))) v_~x$w_buff0_used~0_313) (= v_~x$r_buff0_thd2~0_126 1) (= v_~y~0_68 2) (= (ite .cse0 v_~x$mem_tmp~0_74 .cse6) v_~x~0_218) (= v_~x$w_buff0~0_229 v_~x$w_buff1~0_195) (= v_~x$r_buff1_thd2~0_91 v_~x$r_buff0_thd2~0_127)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_229, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_108, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_156, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_94|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_127, ~x~0=v_~x~0_219, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_94|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_227, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~x$flush_delayed~0=v_~x$flush_delayed~0_83, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_157, ~x$mem_tmp~0=v_~x$mem_tmp~0_74, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_35|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_90, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~y~0=v_~y~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_108, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_195, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_112, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313, ~weak$$choice0~0=v_~weak$$choice0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~x~0=v_~x~0_218} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [272] L779-->L786: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_73 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_72 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x$r_buff0_thd2~0_32 (ite .cse3 0 v_~x$r_buff0_thd2~0_33)) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_45 (ite .cse4 v_~x$w_buff1~0_42 v_~x~0_49))) (= v_~x$w_buff1_used~0_72 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:21:00,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [371] $Ultimate##0-->L786: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_160 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_321 256) 0))) (let ((.cse15 (and .cse1 .cse10))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse14 (or .cse1 .cse15)) (.cse13 (not .cse1))) (let ((.cse6 (ite .cse0 1 (ite .cse14 1 (ite .cse13 0 1))))) (let ((.cse4 (= (mod .cse6 256) 0))) (let ((.cse12 (ite .cse0 v_~x$w_buff0_used~0_321 (ite (or .cse1 .cse4 .cse15) v_~x$w_buff0_used~0_321 0)))) (let ((.cse3 (= (mod .cse12 256) 0)) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_132 256) 0)))) (let ((.cse9 (ite .cse14 v_~x~0_224 (ite .cse13 1 v_~x$w_buff1~0_199))) (.cse8 (and (not .cse3) .cse11)) (.cse7 (not (= (mod v_~x$w_buff0_used~0_319 256) 0))) (.cse5 (not .cse4))) (and (= (ite .cse0 v_~x$r_buff0_thd1~0_160 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_159 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~x$r_buff0_thd1~0_160 0)) v_~x$r_buff1_thd1~0_161) (= v_~x$flush_delayed~0_85 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~x$w_buff0_used~0_319 (ite .cse5 0 .cse6)) (= |v_P0Thread1of1ForFork1_#t~nondet4_98| v_~weak$$choice2~0_92) (= v_~x$r_buff0_thd2~0_130 (ite .cse7 0 1)) (= v_~x$r_buff0_thd0~0_110 v_~x$r_buff1_thd0~0_114) (= (ite .cse5 v_~x$w_buff0~0_233 (ite .cse8 v_~x$w_buff1~0_199 (ite .cse0 v_~x$mem_tmp~0_76 .cse9))) v_~x~0_222) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= v_~x$w_buff0~0_234 v_~x$w_buff1~0_199) (= .cse9 v_~__unbuffered_p0_EAX~0_92) (= (ite .cse10 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= v_~x$mem_tmp~0_76 v_~x~0_224) (= v_~y~0_72 2) (= v_~x$w_buff0~0_233 1) (= v_~x$r_buff1_thd2~0_93 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_279 256) 0)) .cse11) (and (not (= (mod v_~x$r_buff0_thd2~0_130 256) 0)) .cse7)) 0 v_~x$r_buff0_thd2~0_132)) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= (ite (or .cse8 .cse7) 0 .cse12) v_~x$w_buff1_used~0_279) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= v_~x$r_buff0_thd1~0_159 (ite .cse0 v_~x$r_buff0_thd1~0_160 (ite (or .cse1 (and .cse1 .cse3) .cse4) v_~x$r_buff0_thd1~0_160 (ite (and .cse5 .cse13) 0 v_~x$r_buff0_thd1~0_160)))) (= |v_P0Thread1of1ForFork1_#t~nondet3_98| v_~weak$$choice0~0_65) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_234, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_160, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_98|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_132, ~x~0=v_~x~0_224, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_98|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_321} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_233, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, ~x$flush_delayed~0=v_~x$flush_delayed~0_85, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_161, ~x$mem_tmp~0=v_~x$mem_tmp~0_76, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~y~0=v_~y~0_72, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_199, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_130, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_319, ~weak$$choice0~0=v_~weak$$choice0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_222} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [334] L756-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-05 23:21:00,886 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:21:00,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1176 [2022-12-05 23:21:00,887 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 10 transitions, 60 flow [2022-12-05 23:21:00,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-12-05 23:21:00,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:00,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:00,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:21:00,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:00,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1902226123, now seen corresponding path program 1 times [2022-12-05 23:21:00,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:00,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553259817] [2022-12-05 23:21:00,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:21:00,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:21:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:21:00,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:21:00,948 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:21:00,948 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:21:00,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:21:00,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:21:00,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:21:00,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:21:00,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:21:00,950 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:00,953 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:21:00,954 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:21:00,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:21:00 BasicIcfg [2022-12-05 23:21:00,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:21:00,974 INFO L158 Benchmark]: Toolchain (without parser) took 7597.82ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 163.0MB in the beginning and 145.4MB in the end (delta: 17.6MB). Peak memory consumption was 122.5MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,974 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:21:00,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.29ms. Allocated memory is still 187.7MB. Free memory was 162.6MB in the beginning and 138.4MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.89ms. Allocated memory is still 187.7MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,975 INFO L158 Benchmark]: Boogie Preprocessor took 16.87ms. Allocated memory is still 187.7MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,975 INFO L158 Benchmark]: RCFGBuilder took 577.67ms. Allocated memory is still 187.7MB. Free memory was 134.2MB in the beginning and 142.0MB in the end (delta: -7.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,975 INFO L158 Benchmark]: TraceAbstraction took 6670.93ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 141.2MB in the beginning and 145.4MB in the end (delta: -4.2MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-12-05 23:21:00,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.29ms. Allocated memory is still 187.7MB. Free memory was 162.6MB in the beginning and 138.4MB in the end (delta: 24.2MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.89ms. Allocated memory is still 187.7MB. Free memory was 137.9MB in the beginning and 135.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.87ms. Allocated memory is still 187.7MB. Free memory was 135.8MB in the beginning and 134.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 577.67ms. Allocated memory is still 187.7MB. Free memory was 134.2MB in the beginning and 142.0MB in the end (delta: -7.8MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6670.93ms. Allocated memory was 187.7MB in the beginning and 291.5MB in the end (delta: 103.8MB). Free memory was 141.2MB in the beginning and 145.4MB in the end (delta: -4.2MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 89 PlacesBefore, 25 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 765, independent: 728, independent conditional: 728, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 765, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 765, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 765, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 585, independent: 563, independent conditional: 0, independent unconditional: 563, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 585, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 765, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 585, unknown conditional: 0, unknown unconditional: 585] , Statistics on independence cache: Total cache size (in pairs): 936, Positive cache size: 914, Positive conditional cache size: 0, Positive unconditional cache size: 914, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 21 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 37, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 50, dependent conditional: 11, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 32, unknown conditional: 5, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 21, Positive conditional cache size: 3, Positive unconditional cache size: 18, Negative cache size: 11, Negative conditional cache size: 2, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 24, independent conditional: 5, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 30 PlacesBefore, 28 PlacesAfterwards, 18 TransitionsBefore, 16 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 23, Positive conditional cache size: 3, Positive unconditional cache size: 20, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 29 PlacesBefore, 27 PlacesAfterwards, 14 TransitionsBefore, 12 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 30, Positive conditional cache size: 5, Positive unconditional cache size: 25, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 25 PlacesBefore, 22 PlacesAfterwards, 12 TransitionsBefore, 10 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 30, Positive conditional cache size: 5, Positive unconditional cache size: 25, Negative cache size: 17, Negative conditional cache size: 2, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2561, ((void *)0), P0, ((void *)0))=-2, t2561={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L805] 0 pthread_t t2562; [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2562, ((void *)0), P1, ((void *)0))=-1, t2561={5:0}, t2562={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 [L778] 2 y = 1 [L737] 2 y = 2 [L742] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 2 x$flush_delayed = weak$$choice2 [L745] 2 x$mem_tmp = x [L746] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 2 __unbuffered_p0_EAX = x [L754] 2 x = x$flush_delayed ? x$mem_tmp : x [L755] 2 x$flush_delayed = (_Bool)0 [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 806]: 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: 804]: 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 5 procedures, 103 locations, 5 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: 6.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 29, 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.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-05 23:21:00,990 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...