/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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:18:48,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:18:48,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:18:48,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:18:48,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:18:48,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:18:48,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:18:48,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:18:48,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:18:48,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:18:48,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:18:48,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:18:48,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:18:48,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:18:48,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:18:48,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:18:48,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:18:48,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:18:48,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:18:48,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:18:48,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:18:48,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:18:48,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:18:48,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:18:48,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:18:48,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:18:48,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:18:48,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:18:48,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:18:48,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:18:48,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:18:48,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:18:48,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:18:48,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:18:48,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:18:48,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:18:48,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:18:48,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:18:48,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:18:48,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:18:48,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:18:48,701 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:18:48,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:18:48,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:18:48,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:18:48,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:18:48,733 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:18:48,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:18:48,734 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:18:48,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:18:48,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:18:48,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:18:48,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:18:48,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:18:48,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:18:48,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:18:48,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:18:48,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:18:48,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:18:48,737 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:18:49,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:18:49,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:18:49,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:18:49,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:18:49,080 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:18:49,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 06:18:50,285 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:18:50,610 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:18:50,611 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 06:18:50,626 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07bc845b/655f3b24407f4c1d871bab08c8c076b7/FLAG6c659e90e [2022-12-13 06:18:50,645 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07bc845b/655f3b24407f4c1d871bab08c8c076b7 [2022-12-13 06:18:50,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:18:50,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:18:50,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:18:50,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:18:50,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:18:50,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:18:50" (1/1) ... [2022-12-13 06:18:50,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e83727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:50, skipping insertion in model container [2022-12-13 06:18:50,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:18:50" (1/1) ... [2022-12-13 06:18:50,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:18:50,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:18:50,880 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-13 06:18:50,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:50,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:50,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:18:51,029 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:18:51,038 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-12-13 06:18:51,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:18:51,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:18:51,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:18:51,092 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:18:51,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51 WrapperNode [2022-12-13 06:18:51,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:18:51,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:18:51,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:18:51,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:18:51,099 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:18:51" (1/1) ... [2022-12-13 06:18:51,110 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:18:51" (1/1) ... [2022-12-13 06:18:51,130 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 06:18:51,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:18:51,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:18:51,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:18:51,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:18:51,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,149 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:18:51,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:18:51,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:18:51,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:18:51,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (1/1) ... [2022-12-13 06:18:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:18:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:18:51,205 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:18:51,225 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:18:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:18:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:18:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:18:51,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 06:18:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 06:18:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:18:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:18:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:18:51,238 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:18:51,328 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:18:51,330 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:18:51,573 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:18:51,706 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:18:51,707 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:18:51,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:18:51 BoogieIcfgContainer [2022-12-13 06:18:51,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:18:51,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:18:51,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:18:51,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:18:51,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:18:50" (1/3) ... [2022-12-13 06:18:51,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49771982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:18:51, skipping insertion in model container [2022-12-13 06:18:51,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:18:51" (2/3) ... [2022-12-13 06:18:51,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49771982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:18:51, skipping insertion in model container [2022-12-13 06:18:51,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:18:51" (3/3) ... [2022-12-13 06:18:51,721 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 06:18:51,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:18:51,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 06:18:51,736 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:18:51,780 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:18:51,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 06:18:51,860 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 06:18:51,860 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:18:51,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 06:18:51,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2022-12-13 06:18:51,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2022-12-13 06:18:51,869 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:18:51,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 06:18:51,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2022-12-13 06:18:51,921 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2022-12-13 06:18:51,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:18:51,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 06:18:51,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2022-12-13 06:18:51,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 06:18:58,419 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 06:18:58,434 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:18:58,438 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;@7792e92c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:18:58,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 06:18:58,441 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 06:18:58,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:18:58,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:18:58,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:18:58,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:18:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:18:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 379366899, now seen corresponding path program 1 times [2022-12-13 06:18:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:18:58,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627821049] [2022-12-13 06:18:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:18:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:18:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:18:58,785 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:18:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:18:58,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627821049] [2022-12-13 06:18:58,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627821049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:18:58,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:18:58,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:18:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873493479] [2022-12-13 06:18:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:18:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:18:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:18:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:18:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:18:58,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 06:18:58,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:18:58,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:18:58,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 06:18:58,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:18:59,272 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-13 06:18:59,273 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:18:59,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 12073 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-13 06:18:59,288 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-13 06:18:59,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-13 06:18:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:18:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:18:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 06:18:59,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-13 06:18:59,308 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 06:18:59,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 69 transitions, 268 flow [2022-12-13 06:18:59,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 108 flow [2022-12-13 06:18:59,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:18:59,324 INFO L89 Accepts]: Start accepts. Operand has 31 places, 29 transitions, 108 flow [2022-12-13 06:18:59,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:18:59,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:18:59,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 29 transitions, 108 flow [2022-12-13 06:18:59,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 29 transitions, 108 flow [2022-12-13 06:18:59,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 06:18:59,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:18:59,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 06:18:59,369 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 108 flow [2022-12-13 06:18:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:18:59,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:18:59,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:18:59,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:18:59,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:18:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:18:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -500557936, now seen corresponding path program 1 times [2022-12-13 06:18:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:18:59,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622783992] [2022-12-13 06:18:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:18:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:18:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:18:59,927 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:18:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:18:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622783992] [2022-12-13 06:18:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622783992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:18:59,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:18:59,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:18:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417006771] [2022-12-13 06:18:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:18:59,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:18:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:18:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:18:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:18:59,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 06:18:59,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:18:59,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:18:59,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 06:18:59,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:00,003 INFO L130 PetriNetUnfolder]: 173/350 cut-off events. [2022-12-13 06:19:00,003 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 06:19:00,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 350 events. 173/350 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1501 event pairs, 25 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 943. Up to 290 conditions per place. [2022-12-13 06:19:00,007 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 26 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-13 06:19:00,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:19:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:19:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-13 06:19:00,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 06:19:00,009 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -18 predicate places. [2022-12-13 06:19:00,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:00,014 INFO L89 Accepts]: Start accepts. Operand has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:00,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:00,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 06:19:00,028 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:19:00,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 06:19:00,030 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 35 transitions, 191 flow [2022-12-13 06:19:00,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:00,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:00,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:19:00,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1662571766, now seen corresponding path program 1 times [2022-12-13 06:19:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694066499] [2022-12-13 06:19:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:00,482 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:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:00,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694066499] [2022-12-13 06:19:00,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694066499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:00,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:00,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:19:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629915928] [2022-12-13 06:19:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:00,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:19:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:19:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:19:00,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 06:19:00,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 35 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:00,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:00,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 06:19:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:00,597 INFO L130 PetriNetUnfolder]: 169/352 cut-off events. [2022-12-13 06:19:00,597 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-13 06:19:00,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 352 events. 169/352 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1540 event pairs, 11 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1230. Up to 284 conditions per place. [2022-12-13 06:19:00,600 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 29 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2022-12-13 06:19:00,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:19:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:19:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 06:19:00,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 06:19:00,603 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2022-12-13 06:19:00,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:00,608 INFO L89 Accepts]: Start accepts. Operand has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:00,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:00,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 06:19:00,611 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:19:00,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 06:19:00,613 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 287 flow [2022-12-13 06:19:00,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:00,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:00,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:00,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:19:00,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2132275356, now seen corresponding path program 1 times [2022-12-13 06:19:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930828479] [2022-12-13 06:19:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:01,001 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:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:01,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930828479] [2022-12-13 06:19:01,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930828479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:01,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:01,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:19:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96981798] [2022-12-13 06:19:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:01,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:19:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:19:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:19:01,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-13 06:19:01,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:01,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:01,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-13 06:19:01,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:01,106 INFO L130 PetriNetUnfolder]: 204/386 cut-off events. [2022-12-13 06:19:01,106 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-13 06:19:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 386 events. 204/386 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1588 event pairs, 21 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1723. Up to 320 conditions per place. [2022-12-13 06:19:01,109 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 35 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2022-12-13 06:19:01,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:19:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:19:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-13 06:19:01,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 06:19:01,111 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2022-12-13 06:19:01,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:01,115 INFO L89 Accepts]: Start accepts. Operand has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:01,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:01,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 06:19:01,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:19:01,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 06:19:01,260 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 49 transitions, 448 flow [2022-12-13 06:19:01,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:01,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:01,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:01,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:19:01,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1299626988, now seen corresponding path program 2 times [2022-12-13 06:19:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054306382] [2022-12-13 06:19:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:19:01,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:01,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054306382] [2022-12-13 06:19:01,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054306382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:01,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:01,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:19:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473587747] [2022-12-13 06:19:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:01,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 06:19:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:01,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 06:19:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 06:19:01,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 06:19:01,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 49 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:01,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:01,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 06:19:01,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:02,054 INFO L130 PetriNetUnfolder]: 210/397 cut-off events. [2022-12-13 06:19:02,054 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-13 06:19:02,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 397 events. 210/397 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1620 event pairs, 40 based on Foata normal form. 8/353 useless extension candidates. Maximal degree in co-relation 2118. Up to 322 conditions per place. [2022-12-13 06:19:02,058 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 40 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2022-12-13 06:19:02,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:19:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:19:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 06:19:02,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5739130434782609 [2022-12-13 06:19:02,060 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2022-12-13 06:19:02,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:02,067 INFO L89 Accepts]: Start accepts. Operand has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:02,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:02,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 59 transitions, 648 flow [2022-12-13 06:19:02,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 06:19:02,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:19:02,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 797 [2022-12-13 06:19:02,864 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 59 transitions, 650 flow [2022-12-13 06:19:02,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:02,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:02,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:02,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:19:02,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash 188084, now seen corresponding path program 1 times [2022-12-13 06:19:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:02,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201905678] [2022-12-13 06:19:02,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:02,978 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:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:02,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201905678] [2022-12-13 06:19:02,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201905678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:02,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:02,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:19:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141752204] [2022-12-13 06:19:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:02,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:19:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:19:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:19:02,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 06:19:02,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 59 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:19:02,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:02,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 06:19:02,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:03,055 INFO L130 PetriNetUnfolder]: 141/303 cut-off events. [2022-12-13 06:19:03,055 INFO L131 PetriNetUnfolder]: For 618/619 co-relation queries the response was YES. [2022-12-13 06:19:03,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 303 events. 141/303 cut-off events. For 618/619 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1304 event pairs, 16 based on Foata normal form. 18/289 useless extension candidates. Maximal degree in co-relation 1812. Up to 235 conditions per place. [2022-12-13 06:19:03,058 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 38 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-13 06:19:03,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:19:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:19:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-13 06:19:03,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-13 06:19:03,062 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 06:19:03,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:03,068 INFO L89 Accepts]: Start accepts. Operand has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:03,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:03,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 06:19:03,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:19:03,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 06:19:03,073 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 58 transitions, 719 flow [2022-12-13 06:19:03,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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:19:03,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:03,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:19:03,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:03,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1849730058, now seen corresponding path program 1 times [2022-12-13 06:19:03,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:03,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313436592] [2022-12-13 06:19:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:03,174 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:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313436592] [2022-12-13 06:19:03,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313436592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:03,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:03,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:19:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371756552] [2022-12-13 06:19:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:03,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:19:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:19:03,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:19:03,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 06:19:03,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 58 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:03,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:03,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 06:19:03,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:03,227 INFO L130 PetriNetUnfolder]: 48/138 cut-off events. [2022-12-13 06:19:03,227 INFO L131 PetriNetUnfolder]: For 479/482 co-relation queries the response was YES. [2022-12-13 06:19:03,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 138 events. 48/138 cut-off events. For 479/482 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 2 based on Foata normal form. 27/148 useless extension candidates. Maximal degree in co-relation 918. Up to 100 conditions per place. [2022-12-13 06:19:03,229 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 27 selfloop transitions, 17 changer transitions 1/53 dead transitions. [2022-12-13 06:19:03,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 737 flow [2022-12-13 06:19:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:19:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:19:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 06:19:03,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2022-12-13 06:19:03,231 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2022-12-13 06:19:03,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 53 transitions, 737 flow [2022-12-13 06:19:03,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 52 transitions, 735 flow [2022-12-13 06:19:03,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:03,234 INFO L89 Accepts]: Start accepts. Operand has 46 places, 52 transitions, 735 flow [2022-12-13 06:19:03,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:03,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:03,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 52 transitions, 735 flow [2022-12-13 06:19:03,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 52 transitions, 735 flow [2022-12-13 06:19:03,236 INFO L226 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-13 06:19:11,633 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:19:11,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8401 [2022-12-13 06:19:11,634 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 51 transitions, 719 flow [2022-12-13 06:19:11,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:11,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:11,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:19:11,635 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -732729224, now seen corresponding path program 1 times [2022-12-13 06:19:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:11,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939712696] [2022-12-13 06:19:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:11,766 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:11,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:11,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939712696] [2022-12-13 06:19:11,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939712696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:11,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:11,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 06:19:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008032335] [2022-12-13 06:19:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:11,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 06:19:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 06:19:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 06:19:11,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 19 [2022-12-13 06:19:11,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 51 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:11,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:11,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 19 [2022-12-13 06:19:11,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:11,834 INFO L130 PetriNetUnfolder]: 66/173 cut-off events. [2022-12-13 06:19:11,834 INFO L131 PetriNetUnfolder]: For 531/533 co-relation queries the response was YES. [2022-12-13 06:19:11,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 173 events. 66/173 cut-off events. For 531/533 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 702 event pairs, 2 based on Foata normal form. 11/156 useless extension candidates. Maximal degree in co-relation 1288. Up to 128 conditions per place. [2022-12-13 06:19:11,836 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 23 selfloop transitions, 3 changer transitions 38/71 dead transitions. [2022-12-13 06:19:11,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 1154 flow [2022-12-13 06:19:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 06:19:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 06:19:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 06:19:11,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-13 06:19:11,839 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-12-13 06:19:11,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 71 transitions, 1154 flow [2022-12-13 06:19:11,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 33 transitions, 510 flow [2022-12-13 06:19:11,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:11,846 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 510 flow [2022-12-13 06:19:11,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:11,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:11,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 510 flow [2022-12-13 06:19:11,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 510 flow [2022-12-13 06:19:11,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 06:19:12,135 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:19:12,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-13 06:19:12,136 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 502 flow [2022-12-13 06:19:12,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:12,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:12,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:12,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:19:12,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1096402514, now seen corresponding path program 1 times [2022-12-13 06:19:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:12,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622823676] [2022-12-13 06:19:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:35,318 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:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:35,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622823676] [2022-12-13 06:19:35,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622823676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:35,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:35,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 06:19:35,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855840331] [2022-12-13 06:19:35,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:35,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:19:35,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:35,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:19:35,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:19:35,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-13 06:19:35,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:35,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:35,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-13 06:19:35,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:35,428 INFO L130 PetriNetUnfolder]: 36/107 cut-off events. [2022-12-13 06:19:35,429 INFO L131 PetriNetUnfolder]: For 434/436 co-relation queries the response was YES. [2022-12-13 06:19:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 107 events. 36/107 cut-off events. For 434/436 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 398 event pairs, 2 based on Foata normal form. 11/95 useless extension candidates. Maximal degree in co-relation 875. Up to 86 conditions per place. [2022-12-13 06:19:35,430 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2022-12-13 06:19:35,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 808 flow [2022-12-13 06:19:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 06:19:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 06:19:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 06:19:35,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 06:19:35,452 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-12-13 06:19:35,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 808 flow [2022-12-13 06:19:35,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 27 transitions, 456 flow [2022-12-13 06:19:35,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:35,456 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 456 flow [2022-12-13 06:19:35,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:35,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:35,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 456 flow [2022-12-13 06:19:35,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 27 transitions, 456 flow [2022-12-13 06:19:35,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-13 06:19:35,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:19:35,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 06:19:35,477 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 464 flow [2022-12-13 06:19:35,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:35,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:35,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:35,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:19:35,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1924190503, now seen corresponding path program 1 times [2022-12-13 06:19:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303643756] [2022-12-13 06:19:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:19:36,034 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:36,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:19:36,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303643756] [2022-12-13 06:19:36,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303643756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:19:36,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:19:36,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:19:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208263521] [2022-12-13 06:19:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:19:36,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 06:19:36,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:19:36,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 06:19:36,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 06:19:36,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2022-12-13 06:19:36,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:36,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:19:36,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2022-12-13 06:19:36,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:19:36,106 INFO L130 PetriNetUnfolder]: 30/94 cut-off events. [2022-12-13 06:19:36,106 INFO L131 PetriNetUnfolder]: For 401/402 co-relation queries the response was YES. [2022-12-13 06:19:36,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 94 events. 30/94 cut-off events. For 401/402 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 381 event pairs, 0 based on Foata normal form. 10/83 useless extension candidates. Maximal degree in co-relation 840. Up to 78 conditions per place. [2022-12-13 06:19:36,107 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 17 selfloop transitions, 5 changer transitions 10/37 dead transitions. [2022-12-13 06:19:36,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 728 flow [2022-12-13 06:19:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:19:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 06:19:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 06:19:36,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-13 06:19:36,109 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 06:19:36,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 37 transitions, 728 flow [2022-12-13 06:19:36,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 27 transitions, 516 flow [2022-12-13 06:19:36,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:19:36,111 INFO L89 Accepts]: Start accepts. Operand has 48 places, 27 transitions, 516 flow [2022-12-13 06:19:36,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:19:36,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:19:36,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 27 transitions, 516 flow [2022-12-13 06:19:36,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 27 transitions, 516 flow [2022-12-13 06:19:36,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 06:19:36,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] $Ultimate##0-->L768: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27| 0)) (= v_~x$w_buff0_used~0_516 v_~x$w_buff1_used~0_478) (= v_~x$r_buff0_thd0~0_339 v_~x$r_buff1_thd0~0_345) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_478 256) 0)) (not (= (mod v_~x$w_buff0_used~0_515 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_25| |v_P1Thread1of1ForFork0_~arg#1.offset_25|) (= v_~x$w_buff0~0_362 v_~x$w_buff1~0_338) (= v_~y~0_38 v_~__unbuffered_p1_EAX~0_139) (= v_~x$r_buff0_thd1~0_151 v_~x$r_buff1_thd1~0_159) (= v_~x$r_buff0_thd2~0_131 v_~x$r_buff1_thd2~0_105) (= v_~x$r_buff0_thd2~0_130 1) (= v_~x$w_buff0_used~0_515 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_25| |v_P1Thread1of1ForFork0_#in~arg#1.base_25|) (= 2 v_~x$w_buff0~0_361)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_362, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_339, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, ~y~0=v_~y~0_38, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_131, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_516} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_361, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_339, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_25|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_478, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_159, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_130, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_345, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_515, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_139, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] and [391] $Ultimate##0-->L740: Formula: (and (= v_~y~0_40 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_437 1) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~y~0=v_~y~0_40, ~x~0=v_~x~0_437, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 06:19:36,514 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 06:19:36,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 404 [2022-12-13 06:19:36,515 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 498 flow [2022-12-13 06:19:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:36,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:19:36,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:19:36,515 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 06:19:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:19:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 18863126, now seen corresponding path program 1 times [2022-12-13 06:19:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:19:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722066243] [2022-12-13 06:19:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:19:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:19:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:19:36,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:19:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:19:36,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:19:36,587 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:19:36,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 06:19:36,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 06:19:36,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 06:19:36,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 06:19:36,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 06:19:36,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:19:36,593 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:19:36,599 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:19:36,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:19:36,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:19:36 BasicIcfg [2022-12-13 06:19:36,642 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:19:36,643 INFO L158 Benchmark]: Toolchain (without parser) took 45995.20ms. Allocated memory was 177.2MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 152.1MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 06:19:36,643 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:19:36,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.37ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 127.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 06:19:36,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 177.2MB. Free memory was 127.1MB in the beginning and 124.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:19:36,644 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 177.2MB. Free memory was 124.4MB in the beginning and 122.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 06:19:36,644 INFO L158 Benchmark]: RCFGBuilder took 561.30ms. Allocated memory was 177.2MB in the beginning and 271.6MB in the end (delta: 94.4MB). Free memory was 122.6MB in the beginning and 243.3MB in the end (delta: -120.7MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2022-12-13 06:19:36,644 INFO L158 Benchmark]: TraceAbstraction took 44926.20ms. Allocated memory was 271.6MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 242.2MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 06:19:36,645 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory is still 153.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.37ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 127.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 177.2MB. Free memory was 127.1MB in the beginning and 124.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 177.2MB. Free memory was 124.4MB in the beginning and 122.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 561.30ms. Allocated memory was 177.2MB in the beginning and 271.6MB in the end (delta: 94.4MB). Free memory was 122.6MB in the beginning and 243.3MB in the end (delta: -120.7MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. * TraceAbstraction took 44926.20ms. Allocated memory was 271.6MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 242.2MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 90 PlacesBefore, 51 PlacesAfterwards, 85 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 1427, independent unconditional: 0, dependent: 200, dependent conditional: 200, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1627, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, independent: 839, independent conditional: 0, independent unconditional: 839, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, independent: 822, independent conditional: 0, independent unconditional: 822, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 429, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 413, dependent conditional: 0, dependent unconditional: 413, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1627, independent: 588, independent conditional: 0, independent unconditional: 588, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 892, unknown conditional: 0, unknown unconditional: 892] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1282, Positive conditional cache size: 0, Positive unconditional cache size: 1282, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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, 31 PlacesBefore, 31 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 47, 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: 52, independent: 47, independent conditional: 16, independent unconditional: 31, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 47, independent conditional: 4, independent unconditional: 43, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 4, independent unconditional: 43, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 6, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 26, unknown conditional: 4, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 2, Positive unconditional cache size: 21, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 2, Positive unconditional cache size: 26, Negative cache size: 4, Negative conditional cache size: 2, 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, 36 PlacesBefore, 36 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 28, Positive conditional cache size: 2, Positive unconditional cache size: 26, Negative cache size: 4, Negative conditional cache size: 2, 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.1s, 39 PlacesBefore, 39 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent unconditional: 3, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 31, Positive conditional cache size: 2, Positive unconditional cache size: 29, Negative cache size: 4, Negative conditional cache size: 2, 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.8s, 43 PlacesBefore, 43 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 37, Positive conditional cache size: 2, Positive unconditional cache size: 35, Negative cache size: 4, Negative conditional cache size: 2, 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, 45 PlacesBefore, 45 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 124 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): 41, Positive cache size: 37, Positive conditional cache size: 2, Positive unconditional cache size: 35, Negative cache size: 4, Negative conditional cache size: 2, 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: 8.4s, 46 PlacesBefore, 45 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 96 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): 41, Positive cache size: 37, Positive conditional cache size: 2, Positive unconditional cache size: 35, Negative cache size: 4, Negative conditional cache size: 2, 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.3s, 44 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 56 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: 2, independent unconditional: 1, 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: 2, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 38, Positive conditional cache size: 3, Positive unconditional cache size: 35, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 40, Positive conditional cache size: 3, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 48 PlacesBefore, 46 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 42, Positive conditional cache size: 5, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 2, 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 [L767] 2 __unbuffered_p1_EAX = y [L736] 2 y = 1 [L739] 2 x = 1 [L742] 2 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 2 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 2 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 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: 44.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 9 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 06:19:36,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...