/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 --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:19:45,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:19:45,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:19:45,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:19:45,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:19:45,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:19:45,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:19:45,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:19:45,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:19:45,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:19:45,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:19:45,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:19:45,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:19:45,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:19:45,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:19:45,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:19:45,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:19:45,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:19:45,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:19:45,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:19:45,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:19:45,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:19:45,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:19:45,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:19:45,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:19:45,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:19:45,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:19:45,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:19:45,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:19:45,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:19:45,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:19:45,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:19:45,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:19:45,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:19:45,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:19:45,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:19:45,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:19:45,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:19:45,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:19:45,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:19:45,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:19:45,469 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-13 06:19:45,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:19:45,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:19:45,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:19:45,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:19:45,505 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:19:45,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:19:45,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:19:45,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:19:45,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:19:45,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:19:45,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:19:45,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:19:45,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:19:45,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:19:45,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:19:45,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:19:45,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:19:45,510 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:19:45,510 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:19:45,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:19:45,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:19:45,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:19:45,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:19:45,853 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:19:45,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:19:47,099 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:19:47,376 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:19:47,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:19:47,391 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcde7419/6a507175b1094831a2554e96bfbb630e/FLAGd00bb986a [2022-12-13 06:19:47,406 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcde7419/6a507175b1094831a2554e96bfbb630e [2022-12-13 06:19:47,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:19:47,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:19:47,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:19:47,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:19:47,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:19:47,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:47,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb92f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47, skipping insertion in model container [2022-12-13 06:19:47,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:47,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:19:47,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:19:47,600 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 06:19:47,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:19:47,856 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:19:47,868 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 06:19:47,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:19:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:19:47,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:19:47,972 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:19:47,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47 WrapperNode [2022-12-13 06:19:47,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:19:47,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:19:47,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:19:47,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:19:47,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,042 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 06:19:48,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:19:48,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:19:48,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:19:48,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:19:48,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,095 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:19:48,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:19:48,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:19:48,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:19:48,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (1/1) ... [2022-12-13 06:19:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:19:48,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:19:48,137 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-13 06:19:48,161 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-13 06:19:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:19:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:19:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:19:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:19:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:19:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:19:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:19:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:19:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:19:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:19:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:19:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:19:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:19:48,181 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 06:19:48,332 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:19:48,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:19:48,633 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:19:48,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:19:48,797 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:19:48,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:19:48 BoogieIcfgContainer [2022-12-13 06:19:48,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:19:48,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:19:48,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:19:48,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:19:48,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:19:47" (1/3) ... [2022-12-13 06:19:48,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38945dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:19:48, skipping insertion in model container [2022-12-13 06:19:48,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:47" (2/3) ... [2022-12-13 06:19:48,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38945dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:19:48, skipping insertion in model container [2022-12-13 06:19:48,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:19:48" (3/3) ... [2022-12-13 06:19:48,807 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 06:19:48,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:19:48,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:19:48,823 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:19:48,871 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:19:48,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 06:19:48,960 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 06:19:48,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:19:48,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 06:19:48,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 06:19:48,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 06:19:48,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:48,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 06:19:48,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 06:19:49,061 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 06:19:49,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:19:49,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 06:19:49,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 06:19:49,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 06:19:56,390 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 06:19:56,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:19:56,420 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;@9415529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:19:56,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 06:19:56,423 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 06:19:56,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:19:56,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:56,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:19:56,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 480460, now seen corresponding path program 1 times [2022-12-13 06:19:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:56,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715761926] [2022-12-13 06:19:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:56,794 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-13 06:19:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:56,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715761926] [2022-12-13 06:19:56,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715761926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:56,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:56,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:19:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581708709] [2022-12-13 06:19:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:56,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:19:56,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:19:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:19:56,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 51 [2022-12-13 06:19:56,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 06:19:56,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:56,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 51 [2022-12-13 06:19:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:57,470 INFO L130 PetriNetUnfolder]: 1382/2486 cut-off events. [2022-12-13 06:19:57,470 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 06:19:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2486 events. 1382/2486 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15826 event pairs, 498 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 4745. Up to 1941 conditions per place. [2022-12-13 06:19:57,479 INFO L137 encePairwiseOnDemand]: 47/51 looper letters, 26 selfloop transitions, 2 changer transitions 49/84 dead transitions. [2022-12-13 06:19:57,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 329 flow [2022-12-13 06:19:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:19:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:19:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-12-13 06:19:57,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2022-12-13 06:19:57,493 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2022-12-13 06:19:57,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 84 transitions, 329 flow [2022-12-13 06:19:57,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 135 flow [2022-12-13 06:19:57,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:57,514 INFO L89 Accepts]: Start accepts. Operand has 33 places, 35 transitions, 135 flow [2022-12-13 06:19:57,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:57,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:57,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 35 transitions, 135 flow [2022-12-13 06:19:57,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 35 transitions, 135 flow [2022-12-13 06:19:57,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 06:19:57,554 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:19:57,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 06:19:57,556 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 135 flow [2022-12-13 06:19:57,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 06:19:57,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:57,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:57,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:19:57,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1375819425, now seen corresponding path program 1 times [2022-12-13 06:19:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232700214] [2022-12-13 06:19:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:58,443 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-13 06:19:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:58,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232700214] [2022-12-13 06:19:58,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232700214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:58,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:58,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:19:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485205861] [2022-12-13 06:19:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:19:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:19:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:19:58,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 06:19:58,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-13 06:19:58,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:58,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 06:19:58,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:58,587 INFO L130 PetriNetUnfolder]: 267/497 cut-off events. [2022-12-13 06:19:58,588 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 06:19:58,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 497 events. 267/497 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2124 event pairs, 39 based on Foata normal form. 28/467 useless extension candidates. Maximal degree in co-relation 1383. Up to 372 conditions per place. [2022-12-13 06:19:58,591 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 38 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2022-12-13 06:19:58,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:19:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:19:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 06:19:58,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 06:19:58,593 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -22 predicate places. [2022-12-13 06:19:58,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:58,602 INFO L89 Accepts]: Start accepts. Operand has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:58,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:58,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-13 06:19:58,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:19:58,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 06:19:58,644 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 50 transitions, 283 flow [2022-12-13 06:19:58,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-13 06:19:58,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:58,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:58,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:19:58,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 545898278, now seen corresponding path program 1 times [2022-12-13 06:19:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:58,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913280678] [2022-12-13 06:19:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:59,717 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-13 06:19:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:59,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913280678] [2022-12-13 06:19:59,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913280678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:59,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:59,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:19:59,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788943919] [2022-12-13 06:19:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:19:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:19:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:19:59,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:19:59,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 50 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-13 06:19:59,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:59,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:19:59,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:00,025 INFO L130 PetriNetUnfolder]: 265/490 cut-off events. [2022-12-13 06:20:00,025 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 06:20:00,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1815 conditions, 490 events. 265/490 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2056 event pairs, 43 based on Foata normal form. 1/433 useless extension candidates. Maximal degree in co-relation 1799. Up to 386 conditions per place. [2022-12-13 06:20:00,030 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 44 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2022-12-13 06:20:00,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 06:20:00,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2022-12-13 06:20:00,032 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2022-12-13 06:20:00,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:00,040 INFO L89 Accepts]: Start accepts. Operand has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:00,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:00,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 06:20:00,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:00,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 06:20:00,045 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 60 transitions, 447 flow [2022-12-13 06:20:00,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-13 06:20:00,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:00,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:00,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:20:00,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:00,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 781324370, now seen corresponding path program 1 times [2022-12-13 06:20:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:00,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556563794] [2022-12-13 06:20:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:00,719 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-13 06:20:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:00,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556563794] [2022-12-13 06:20:00,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556563794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:00,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:00,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135783235] [2022-12-13 06:20:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:00,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:20:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:20:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:20:00,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:00,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 60 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 06:20:00,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:00,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:00,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:00,907 INFO L130 PetriNetUnfolder]: 310/572 cut-off events. [2022-12-13 06:20:00,907 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2022-12-13 06:20:00,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 572 events. 310/572 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2541 event pairs, 28 based on Foata normal form. 5/513 useless extension candidates. Maximal degree in co-relation 2596. Up to 456 conditions per place. [2022-12-13 06:20:00,913 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 58 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2022-12-13 06:20:00,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:20:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:20:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 06:20:00,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-13 06:20:00,915 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2022-12-13 06:20:00,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:00,925 INFO L89 Accepts]: Start accepts. Operand has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:00,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:00,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 06:20:00,929 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:00,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:20:00,930 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 81 transitions, 764 flow [2022-12-13 06:20:00,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-13 06:20:00,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:00,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:00,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:20:00,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:00,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1548750474, now seen corresponding path program 1 times [2022-12-13 06:20:00,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:00,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25215834] [2022-12-13 06:20:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:02,365 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-13 06:20:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:02,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25215834] [2022-12-13 06:20:02,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25215834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:02,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:02,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:20:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680578193] [2022-12-13 06:20:02,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:02,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:20:02,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:20:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:20:02,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:02,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 81 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-13 06:20:02,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:02,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:02,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:02,695 INFO L130 PetriNetUnfolder]: 499/941 cut-off events. [2022-12-13 06:20:02,695 INFO L131 PetriNetUnfolder]: For 970/970 co-relation queries the response was YES. [2022-12-13 06:20:02,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 941 events. 499/941 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5031 event pairs, 27 based on Foata normal form. 30/845 useless extension candidates. Maximal degree in co-relation 5066. Up to 771 conditions per place. [2022-12-13 06:20:02,702 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 72 selfloop transitions, 23 changer transitions 30/132 dead transitions. [2022-12-13 06:20:02,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 132 transitions, 1524 flow [2022-12-13 06:20:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 06:20:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 06:20:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-12-13 06:20:02,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2022-12-13 06:20:02,704 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2022-12-13 06:20:02,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 132 transitions, 1524 flow [2022-12-13 06:20:02,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 102 transitions, 1163 flow [2022-12-13 06:20:02,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:02,718 INFO L89 Accepts]: Start accepts. Operand has 52 places, 102 transitions, 1163 flow [2022-12-13 06:20:02,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:02,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:02,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 102 transitions, 1163 flow [2022-12-13 06:20:02,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 102 transitions, 1163 flow [2022-12-13 06:20:02,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 06:20:02,724 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:20:02,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 06:20:02,725 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 102 transitions, 1163 flow [2022-12-13 06:20:02,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-13 06:20:02,725 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:02,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:02,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:20:02,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1793191886, now seen corresponding path program 1 times [2022-12-13 06:20:02,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:02,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72198976] [2022-12-13 06:20:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:03,710 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-13 06:20:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:03,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72198976] [2022-12-13 06:20:03,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72198976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:03,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:03,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:20:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276386929] [2022-12-13 06:20:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:03,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:20:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:20:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:20:03,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 06:20:03,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 102 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-13 06:20:03,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:03,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 06:20:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:03,961 INFO L130 PetriNetUnfolder]: 334/625 cut-off events. [2022-12-13 06:20:03,961 INFO L131 PetriNetUnfolder]: For 1572/1572 co-relation queries the response was YES. [2022-12-13 06:20:03,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 625 events. 334/625 cut-off events. For 1572/1572 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2974 event pairs, 24 based on Foata normal form. 11/568 useless extension candidates. Maximal degree in co-relation 3799. Up to 480 conditions per place. [2022-12-13 06:20:03,967 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 91 selfloop transitions, 14 changer transitions 0/112 dead transitions. [2022-12-13 06:20:03,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:20:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:20:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-13 06:20:03,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.568 [2022-12-13 06:20:03,971 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2022-12-13 06:20:03,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:03,985 INFO L89 Accepts]: Start accepts. Operand has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:03,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:03,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 112 transitions, 1493 flow [2022-12-13 06:20:03,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 06:20:09,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:09,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5111 [2022-12-13 06:20:09,096 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 114 transitions, 1557 flow [2022-12-13 06:20:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-13 06:20:09,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:09,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:09,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:20:09,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -80810409, now seen corresponding path program 1 times [2022-12-13 06:20:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:09,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912670762] [2022-12-13 06:20:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:09,298 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-13 06:20:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912670762] [2022-12-13 06:20:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912670762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:09,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:20:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139217208] [2022-12-13 06:20:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:20:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:20:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:20:09,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-13 06:20:09,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 114 transitions, 1557 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 06:20:09,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:09,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-13 06:20:09,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:09,407 INFO L130 PetriNetUnfolder]: 176/391 cut-off events. [2022-12-13 06:20:09,407 INFO L131 PetriNetUnfolder]: For 2072/2076 co-relation queries the response was YES. [2022-12-13 06:20:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 391 events. 176/391 cut-off events. For 2072/2076 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1965 event pairs, 15 based on Foata normal form. 45/400 useless extension candidates. Maximal degree in co-relation 2629. Up to 295 conditions per place. [2022-12-13 06:20:09,412 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 69 selfloop transitions, 23 changer transitions 2/99 dead transitions. [2022-12-13 06:20:09,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 99 transitions, 1471 flow [2022-12-13 06:20:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:20:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:20:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 06:20:09,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2022-12-13 06:20:09,415 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2022-12-13 06:20:09,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 99 transitions, 1471 flow [2022-12-13 06:20:09,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 97 transitions, 1467 flow [2022-12-13 06:20:09,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:09,423 INFO L89 Accepts]: Start accepts. Operand has 56 places, 97 transitions, 1467 flow [2022-12-13 06:20:09,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:09,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:09,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 97 transitions, 1467 flow [2022-12-13 06:20:09,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 97 transitions, 1467 flow [2022-12-13 06:20:09,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 06:20:09,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] $Ultimate##0-->L770: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_33| v_P1Thread1of1ForFork1_~arg.offset_33) (= v_~y~0_618 1) (= 2 v_~x~0_173) (= v_P1Thread1of1ForFork1_~arg.base_33 |v_P1Thread1of1ForFork1_#in~arg.base_33|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_33|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_33|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_33, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_33, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_33|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_33|, ~y~0=v_~y~0_618, ~x~0=v_~x~0_173} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] and [426] $Ultimate##0-->L747: Formula: (and (= |v_P0Thread1of1ForFork0_~arg#1.offset_7| |v_P0Thread1of1ForFork0_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= v_~y$r_buff0_thd1~0_52 1) (= v_~y$r_buff0_thd2~0_137 v_~y$r_buff1_thd2~0_138) (= v_~y$r_buff0_thd0~0_109 v_~y$r_buff1_thd0~0_109) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_262 256) 0)) (not (= (mod v_~y$w_buff0_used~0_281 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= |v_P0Thread1of1ForFork0_~arg#1.base_7| |v_P0Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| 0)) (= v_~y$w_buff0_used~0_281 1) (= v_~y$w_buff0_used~0_282 v_~y$w_buff1_used~0_262) (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_37) (= 2 v_~y$w_buff0~0_198) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_199)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_282, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_281, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_7|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_7|, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_138, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$w_buff1~0=v_~y$w_buff1~0_171, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_198, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_52, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_137, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_17|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_109, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_262} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.base, P0Thread1of1ForFork0_~arg#1.offset, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 06:20:09,917 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:20:09,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 496 [2022-12-13 06:20:09,918 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 96 transitions, 1457 flow [2022-12-13 06:20:09,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-13 06:20:09,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:09,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:20:09,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1609500552, now seen corresponding path program 1 times [2022-12-13 06:20:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:09,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103857781] [2022-12-13 06:20:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:20:10,069 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-13 06:20:10,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:20:10,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103857781] [2022-12-13 06:20:10,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103857781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:20:10,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:20:10,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:20:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638851831] [2022-12-13 06:20:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:20:10,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:20:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:20:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:20:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:20:10,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 06:20:10,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 96 transitions, 1457 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 06:20:10,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:20:10,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 06:20:10,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:20:10,147 INFO L130 PetriNetUnfolder]: 68/184 cut-off events. [2022-12-13 06:20:10,147 INFO L131 PetriNetUnfolder]: For 1579/1583 co-relation queries the response was YES. [2022-12-13 06:20:10,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 184 events. 68/184 cut-off events. For 1579/1583 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 765 event pairs, 3 based on Foata normal form. 49/211 useless extension candidates. Maximal degree in co-relation 1361. Up to 133 conditions per place. [2022-12-13 06:20:10,150 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 49 selfloop transitions, 29 changer transitions 0/82 dead transitions. [2022-12-13 06:20:10,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:20:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:20:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 06:20:10,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-13 06:20:10,155 INFO L295 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2022-12-13 06:20:10,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,165 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:20:10,165 INFO L89 Accepts]: Start accepts. Operand has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:20:10,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:20:10,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 82 transitions, 1389 flow [2022-12-13 06:20:10,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 06:20:11,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:20:11,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1459 [2022-12-13 06:20:11,624 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 81 transitions, 1371 flow [2022-12-13 06:20:11,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-13 06:20:11,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:20:11,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:20:11,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:20:11,625 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:20:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:20:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1521700116, now seen corresponding path program 1 times [2022-12-13 06:20:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:20:11,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253447377] [2022-12-13 06:20:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:20:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:20:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-13 06:34:15,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 06:34:15,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:34:15,845 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-4-3-4-4-3-2-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-6-4-5-4-10-4-6-4-7-4-9-4-6-4-5-4-5-4-4-4-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-4-3-2-1 context. [2022-12-13 06:34:15,846 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 06:34:15,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 06:34:15,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 06:34:15,847 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 06:34:15,847 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:34:15,851 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:34:15,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:34:15,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:34:15 BasicIcfg [2022-12-13 06:34:15,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:34:15,854 INFO L158 Benchmark]: Toolchain (without parser) took 868444.51ms. Allocated memory was 184.5MB in the beginning and 826.3MB in the end (delta: 641.7MB). Free memory was 159.7MB in the beginning and 702.8MB in the end (delta: -543.1MB). Peak memory consumption was 510.3MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,854 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:34:15,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.38ms. Allocated memory is still 184.5MB. Free memory was 159.2MB in the beginning and 131.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.91ms. Allocated memory is still 184.5MB. Free memory was 131.9MB in the beginning and 129.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,855 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 127.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,856 INFO L158 Benchmark]: RCFGBuilder took 699.64ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 81.6MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,856 INFO L158 Benchmark]: TraceAbstraction took 867052.15ms. Allocated memory was 184.5MB in the beginning and 826.3MB in the end (delta: 641.7MB). Free memory was 80.6MB in the beginning and 702.8MB in the end (delta: -622.2MB). Peak memory consumption was 430.6MB. Max. memory is 8.0GB. [2022-12-13 06:34:15,857 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.12ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.38ms. Allocated memory is still 184.5MB. Free memory was 159.2MB in the beginning and 131.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.91ms. Allocated memory is still 184.5MB. Free memory was 131.9MB in the beginning and 129.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.18ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 127.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 699.64ms. Allocated memory is still 184.5MB. Free memory was 127.2MB in the beginning and 81.6MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 867052.15ms. Allocated memory was 184.5MB in the beginning and 826.3MB in the end (delta: 641.7MB). Free memory was 80.6MB in the beginning and 702.8MB in the end (delta: -622.2MB). Peak memory consumption was 430.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 93 PlacesBefore, 58 PlacesAfterwards, 88 TransitionsBefore, 51 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 2173, independent unconditional: 0, dependent: 146, dependent conditional: 146, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2319, independent: 2173, independent conditional: 0, independent unconditional: 2173, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1104, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1104, independent: 1024, independent conditional: 0, independent unconditional: 1024, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 509, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 454, dependent conditional: 0, dependent unconditional: 454, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2319, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1104, unknown conditional: 0, unknown unconditional: 1104] , Statistics on independence cache: Total cache size (in pairs): 2031, Positive cache size: 1982, Positive conditional cache size: 0, Positive unconditional cache size: 1982, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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.0s, 33 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 19, independent conditional: 4, independent unconditional: 15, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 2, independent unconditional: 13, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 11, independent conditional: 6, independent unconditional: 4, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 18, unknown conditional: 3, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 2, Positive unconditional cache size: 13, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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, 36 PlacesBefore, 36 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 2, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 2, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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.0s, 46 PlacesBefore, 46 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 2, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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.0s, 52 PlacesBefore, 52 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 2, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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: 5.1s, 56 PlacesBefore, 57 PlacesAfterwards, 112 TransitionsBefore, 114 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 24, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 21, Positive conditional cache size: 6, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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.5s, 56 PlacesBefore, 55 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 57 PlacesBefore, 56 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 6, Positive unconditional cache size: 17, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-4-3-4-4-3-2-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-6-4-5-4-10-4-6-4-7-4-9-4-6-4-5-4-5-4-4-4-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-4-3-2-1 context. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-4-3-4-4-3-2-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-6-4-5-4-10-4-6-4-7-4-9-4-6-4-5-4-5-4-4-4-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-4-3-2-1 context. - TimeoutResultAtElement [Line: 827]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-4-3-4-4-3-2-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-6-4-5-4-10-4-6-4-7-4-9-4-6-4-5-4-5-4-4-4-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-4-3-2-1 context. - TimeoutResultAtElement [Line: 829]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 14 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-4-3-4-4-3-2-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-6-4-5-4-10-4-6-4-7-4-9-4-6-4-5-4-5-4-4-4-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-2-2-4-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 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: 866.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 637 IncrementalHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 8 mSDtfsCounter, 637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=6, InterpolantAutomatonStates: 38, 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.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 could not prove your program: Timeout Completed graceful shutdown