/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:05:35,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:05:35,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:05:35,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:05:35,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:05:35,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:05:36,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:05:36,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:05:36,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:05:36,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:05:36,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:05:36,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:05:36,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:05:36,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:05:36,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:05:36,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:05:36,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:05:36,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:05:36,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:05:36,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:05:36,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:05:36,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:05:36,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:05:36,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:05:36,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:05:36,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:05:36,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:05:36,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:05:36,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:05:36,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:05:36,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:05:36,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:05:36,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:05:36,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:05:36,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:05:36,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:05:36,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:05:36,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:05:36,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:05:36,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:05:36,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:05:36,044 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 03:05:36,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:05:36,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:05:36,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:05:36,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:05:36,075 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:05:36,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:05:36,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:05:36,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:05:36,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:05:36,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:05:36,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:05:36,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:05:36,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:05:36,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:05:36,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:05:36,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:05:36,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:05:36,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:05:36,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:05:36,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:05:36,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:05:36,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:05:36,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:05:36,079 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 [2022-12-13 03:05:36,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:05:36,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:05:36,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:05:36,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:05:36,404 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:05:36,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-13 03:05:37,637 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:05:37,888 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:05:37,888 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-13 03:05:37,898 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacfa72cf/9102e9747c4a4b41b5139ba6947f9202/FLAG54161f287 [2022-12-13 03:05:37,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aacfa72cf/9102e9747c4a4b41b5139ba6947f9202 [2022-12-13 03:05:37,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:05:37,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:05:37,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:05:37,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:05:37,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:05:37,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:05:37" (1/1) ... [2022-12-13 03:05:37,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c9f41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:37, skipping insertion in model container [2022-12-13 03:05:37,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:05:37" (1/1) ... [2022-12-13 03:05:37,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:05:37,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:05:38,119 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-13 03:05:38,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:05:38,354 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:05:38,367 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/mix034_pso.opt_tso.opt.i[999,1012] [2022-12-13 03:05:38,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:05:38,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:05:38,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:05:38,467 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:05:38,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38 WrapperNode [2022-12-13 03:05:38,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:05:38,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:05:38,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:05:38,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:05:38,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,537 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-12-13 03:05:38,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:05:38,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:05:38,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:05:38,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:05:38,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,580 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:05:38,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:05:38,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:05:38,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:05:38,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (1/1) ... [2022-12-13 03:05:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:05:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:05:38,627 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 03:05:38,633 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 03:05:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:05:38,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:05:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:05:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:05:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:05:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:05:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:05:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:05:38,658 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 03:05:38,822 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:05:38,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:05:39,116 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:05:39,230 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:05:39,230 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:05:39,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:05:39 BoogieIcfgContainer [2022-12-13 03:05:39,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:05:39,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:05:39,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:05:39,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:05:39,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:05:37" (1/3) ... [2022-12-13 03:05:39,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcc0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:05:39, skipping insertion in model container [2022-12-13 03:05:39,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:05:38" (2/3) ... [2022-12-13 03:05:39,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcc0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:05:39, skipping insertion in model container [2022-12-13 03:05:39,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:05:39" (3/3) ... [2022-12-13 03:05:39,243 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2022-12-13 03:05:39,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:05:39,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:05:39,261 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:05:39,301 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:05:39,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 03:05:39,386 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 03:05:39,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:05:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 03:05:39,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 03:05:39,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-13 03:05:39,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:39,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 03:05:39,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-13 03:05:39,461 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 03:05:39,461 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:05:39,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 03:05:39,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 03:05:39,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-13 03:05:43,911 INFO L241 LiptonReduction]: Total number of compositions: 76 [2022-12-13 03:05:43,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:05:43,929 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;@77131db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:05:43,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 03:05:43,933 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 03:05:43,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:05:43,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:43,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:05:43,934 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 03:05:43,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash 400621395, now seen corresponding path program 1 times [2022-12-13 03:05:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:43,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617332398] [2022-12-13 03:05:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:44,324 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 03:05:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:44,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617332398] [2022-12-13 03:05:44,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617332398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:44,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:44,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:05:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315582575] [2022-12-13 03:05:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:44,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:05:44,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:44,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:05:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:05:44,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2022-12-13 03:05:44,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 98 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 03:05:44,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:44,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2022-12-13 03:05:44,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:44,763 INFO L130 PetriNetUnfolder]: 1308/2368 cut-off events. [2022-12-13 03:05:44,764 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:05:44,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 2368 events. 1308/2368 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15194 event pairs, 96 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 4498. Up to 1903 conditions per place. [2022-12-13 03:05:44,778 INFO L137 encePairwiseOnDemand]: 40/46 looper letters, 21 selfloop transitions, 3 changer transitions 38/69 dead transitions. [2022-12-13 03:05:44,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 268 flow [2022-12-13 03:05:44,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:05:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:05:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 03:05:44,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-13 03:05:44,795 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2022-12-13 03:05:44,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 69 transitions, 268 flow [2022-12-13 03:05:44,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 116 flow [2022-12-13 03:05:44,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:44,815 INFO L89 Accepts]: Start accepts. Operand has 33 places, 31 transitions, 116 flow [2022-12-13 03:05:44,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:44,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:44,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 116 flow [2022-12-13 03:05:44,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 116 flow [2022-12-13 03:05:44,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 03:05:44,859 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:05:44,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 03:05:44,862 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 116 flow [2022-12-13 03:05:44,863 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 03:05:44,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:44,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:44,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:05:44,866 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 03:05:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1549883303, now seen corresponding path program 1 times [2022-12-13 03:05:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:44,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678478324] [2022-12-13 03:05:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:45,020 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 03:05:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678478324] [2022-12-13 03:05:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678478324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:45,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:45,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:05:45,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689954566] [2022-12-13 03:05:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:45,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:05:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:05:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:05:45,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 03:05:45,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 03:05:45,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:45,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 03:05:45,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:45,111 INFO L130 PetriNetUnfolder]: 237/456 cut-off events. [2022-12-13 03:05:45,112 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-13 03:05:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 456 events. 237/456 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1994 event pairs, 45 based on Foata normal form. 15/392 useless extension candidates. Maximal degree in co-relation 1241. Up to 328 conditions per place. [2022-12-13 03:05:45,116 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 26 selfloop transitions, 2 changer transitions 3/37 dead transitions. [2022-12-13 03:05:45,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 200 flow [2022-12-13 03:05:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:05:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:05:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 03:05:45,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 03:05:45,119 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2022-12-13 03:05:45,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 200 flow [2022-12-13 03:05:45,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 34 transitions, 186 flow [2022-12-13 03:05:45,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:45,126 INFO L89 Accepts]: Start accepts. Operand has 33 places, 34 transitions, 186 flow [2022-12-13 03:05:45,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:45,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:45,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 34 transitions, 186 flow [2022-12-13 03:05:45,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 34 transitions, 186 flow [2022-12-13 03:05:45,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 03:05:45,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:05:45,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 03:05:45,329 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 186 flow [2022-12-13 03:05:45,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 03:05:45,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:45,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:45,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:05:45,329 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 03:05:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash 915798584, now seen corresponding path program 1 times [2022-12-13 03:05:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:45,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948878106] [2022-12-13 03:05:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:45,489 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 03:05:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948878106] [2022-12-13 03:05:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948878106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:05:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498207165] [2022-12-13 03:05:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:45,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:05:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:05:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:05:45,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 03:05:45,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 03:05:45,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:45,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 03:05:45,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:45,610 INFO L130 PetriNetUnfolder]: 159/342 cut-off events. [2022-12-13 03:05:45,611 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-12-13 03:05:45,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 342 events. 159/342 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1563 event pairs, 22 based on Foata normal form. 42/341 useless extension candidates. Maximal degree in co-relation 1253. Up to 250 conditions per place. [2022-12-13 03:05:45,613 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 32 selfloop transitions, 11 changer transitions 33/80 dead transitions. [2022-12-13 03:05:45,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 80 transitions, 593 flow [2022-12-13 03:05:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:05:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:05:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 03:05:45,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2022-12-13 03:05:45,617 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -15 predicate places. [2022-12-13 03:05:45,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 80 transitions, 593 flow [2022-12-13 03:05:45,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 47 transitions, 345 flow [2022-12-13 03:05:45,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:45,622 INFO L89 Accepts]: Start accepts. Operand has 35 places, 47 transitions, 345 flow [2022-12-13 03:05:45,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:45,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:45,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 47 transitions, 345 flow [2022-12-13 03:05:45,628 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 47 transitions, 345 flow [2022-12-13 03:05:45,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 03:05:45,632 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:05:45,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:05:45,633 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 47 transitions, 345 flow [2022-12-13 03:05:45,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 03:05:45,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:45,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:45,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:05:45,634 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 03:05:45,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -161912856, now seen corresponding path program 1 times [2022-12-13 03:05:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:45,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410983327] [2022-12-13 03:05:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:45,823 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 03:05:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:45,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410983327] [2022-12-13 03:05:45,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410983327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:45,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:45,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:05:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361422057] [2022-12-13 03:05:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:45,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:05:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:45,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:05:45,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:05:45,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 03:05:45,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 47 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 03:05:45,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:45,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 03:05:45,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:45,926 INFO L130 PetriNetUnfolder]: 64/175 cut-off events. [2022-12-13 03:05:45,927 INFO L131 PetriNetUnfolder]: For 94/96 co-relation queries the response was YES. [2022-12-13 03:05:45,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 175 events. 64/175 cut-off events. For 94/96 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 719 event pairs, 4 based on Foata normal form. 32/186 useless extension candidates. Maximal degree in co-relation 803. Up to 139 conditions per place. [2022-12-13 03:05:45,928 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 21 selfloop transitions, 17 changer transitions 15/56 dead transitions. [2022-12-13 03:05:45,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 513 flow [2022-12-13 03:05:45,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:05:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:05:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 03:05:45,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 03:05:45,931 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 03:05:45,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 56 transitions, 513 flow [2022-12-13 03:05:45,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 41 transitions, 379 flow [2022-12-13 03:05:45,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:45,934 INFO L89 Accepts]: Start accepts. Operand has 36 places, 41 transitions, 379 flow [2022-12-13 03:05:45,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:45,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:45,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 41 transitions, 379 flow [2022-12-13 03:05:45,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 41 transitions, 379 flow [2022-12-13 03:05:45,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 03:05:46,207 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:05:46,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-13 03:05:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 369 flow [2022-12-13 03:05:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 03:05:46,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:46,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:05:46,211 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 03:05:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -974660965, now seen corresponding path program 1 times [2022-12-13 03:05:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:46,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925859128] [2022-12-13 03:05:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:46,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:46,666 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 03:05:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:46,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925859128] [2022-12-13 03:05:46,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925859128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:46,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:46,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:05:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396967005] [2022-12-13 03:05:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:46,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:05:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:05:46,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:05:46,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 03:05:46,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 369 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 03:05:46,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:46,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 03:05:46,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:46,836 INFO L130 PetriNetUnfolder]: 66/171 cut-off events. [2022-12-13 03:05:46,836 INFO L131 PetriNetUnfolder]: For 232/234 co-relation queries the response was YES. [2022-12-13 03:05:46,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 171 events. 66/171 cut-off events. For 232/234 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 679 event pairs, 2 based on Foata normal form. 11/154 useless extension candidates. Maximal degree in co-relation 902. Up to 122 conditions per place. [2022-12-13 03:05:46,838 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 28 selfloop transitions, 14 changer transitions 25/72 dead transitions. [2022-12-13 03:05:46,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 819 flow [2022-12-13 03:05:46,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:05:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:05:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-12-13 03:05:46,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4678362573099415 [2022-12-13 03:05:46,842 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2022-12-13 03:05:46,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 72 transitions, 819 flow [2022-12-13 03:05:46,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 47 transitions, 523 flow [2022-12-13 03:05:46,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:46,847 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 523 flow [2022-12-13 03:05:46,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:46,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:46,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 523 flow [2022-12-13 03:05:46,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 47 transitions, 523 flow [2022-12-13 03:05:46,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-13 03:05:46,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [301] L780-->L786: Formula: (and (= v_~y~0_4 1) (= v_~__unbuffered_p1_EAX~0_4 v_~y~0_4)) InVars {} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, ~y~0=v_~y~0_4} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~y~0] and [274] L744-->L760: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd1~0_52 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_52 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 (= (mod v_~x$w_buff1_used~0_83 256) 0))) (.cse6 (and .cse7 .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_96 256) 0))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_82 256) 0)) (.cse1 (= 0 (mod v_~x$w_buff0_used~0_95 256))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse9 (or .cse5 .cse6 .cse11)) (.cse10 (and .cse8 (not .cse11)))) (and (= v_~x$r_buff1_thd1~0_51 (ite .cse0 v_~x$r_buff1_thd1~0_52 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_51 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_52 0))) (= v_~x$w_buff1~0_37 v_~x$w_buff1~0_36) (= v_~x$w_buff1_used~0_82 (ite .cse0 v_~x$w_buff1_used~0_83 (ite (or .cse5 .cse1 .cse6) v_~x$w_buff1_used~0_83 0))) (= v_~x~0_68 (ite .cse0 v_~x$mem_tmp~0_24 v_~__unbuffered_p0_EAX~0_14)) (= v_~x$r_buff0_thd1~0_51 (ite .cse0 v_~x$r_buff0_thd1~0_52 (ite (or .cse1 .cse6 (and .cse4 .cse7)) v_~x$r_buff0_thd1~0_52 (ite (and .cse8 (not .cse1)) 0 v_~x$r_buff0_thd1~0_52)))) (= (ite .cse9 v_~x~0_69 (ite .cse10 v_~x$w_buff0~0_46 v_~x$w_buff1~0_37)) v_~__unbuffered_p0_EAX~0_14) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_7) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_36) (= v_~x$w_buff0~0_46 v_~x$w_buff0~0_45) (= (ite .cse0 v_~x$w_buff0_used~0_96 (ite .cse9 v_~x$w_buff0_used~0_96 (ite .cse10 0 v_~x$w_buff0_used~0_96))) v_~x$w_buff0_used~0_95) (= v_~x~0_69 v_~x$mem_tmp~0_24) (= v_~x$flush_delayed~0_25 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_83, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_82, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 03:05:47,087 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:05:47,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 03:05:47,088 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 46 transitions, 521 flow [2022-12-13 03:05:47,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 03:05:47,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:47,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:47,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:05:47,089 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 03:05:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash -788854153, now seen corresponding path program 1 times [2022-12-13 03:05:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:47,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203131594] [2022-12-13 03:05:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:47,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:47,481 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 03:05:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:47,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203131594] [2022-12-13 03:05:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203131594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:05:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744452250] [2022-12-13 03:05:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:05:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:05:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:05:47,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-13 03:05:47,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 46 transitions, 521 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 03:05:47,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:47,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-13 03:05:47,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:47,630 INFO L130 PetriNetUnfolder]: 64/170 cut-off events. [2022-12-13 03:05:47,630 INFO L131 PetriNetUnfolder]: For 247/250 co-relation queries the response was YES. [2022-12-13 03:05:47,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 170 events. 64/170 cut-off events. For 247/250 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 790 event pairs, 0 based on Foata normal form. 10/152 useless extension candidates. Maximal degree in co-relation 1035. Up to 127 conditions per place. [2022-12-13 03:05:47,632 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 31 selfloop transitions, 17 changer transitions 23/76 dead transitions. [2022-12-13 03:05:47,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 1007 flow [2022-12-13 03:05:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:05:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:05:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2022-12-13 03:05:47,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2022-12-13 03:05:47,635 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2022-12-13 03:05:47,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 76 transitions, 1007 flow [2022-12-13 03:05:47,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 53 transitions, 691 flow [2022-12-13 03:05:47,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:47,639 INFO L89 Accepts]: Start accepts. Operand has 47 places, 53 transitions, 691 flow [2022-12-13 03:05:47,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:47,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:47,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 53 transitions, 691 flow [2022-12-13 03:05:47,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 53 transitions, 691 flow [2022-12-13 03:05:47,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 03:05:47,642 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:05:47,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:05:47,643 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 53 transitions, 691 flow [2022-12-13 03:05:47,643 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 03:05:47,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:47,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:05:47,643 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 03:05:47,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash -816857693, now seen corresponding path program 1 times [2022-12-13 03:05:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:47,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559343576] [2022-12-13 03:05:47,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:47,798 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 03:05:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559343576] [2022-12-13 03:05:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559343576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:47,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:47,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:05:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332619358] [2022-12-13 03:05:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:05:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:05:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:05:47,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-13 03:05:47,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 53 transitions, 691 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 03:05:47,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:47,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-13 03:05:47,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:47,896 INFO L130 PetriNetUnfolder]: 48/149 cut-off events. [2022-12-13 03:05:47,896 INFO L131 PetriNetUnfolder]: For 274/277 co-relation queries the response was YES. [2022-12-13 03:05:47,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 149 events. 48/149 cut-off events. For 274/277 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 675 event pairs, 0 based on Foata normal form. 11/135 useless extension candidates. Maximal degree in co-relation 1003. Up to 111 conditions per place. [2022-12-13 03:05:47,897 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 21 selfloop transitions, 4 changer transitions 33/63 dead transitions. [2022-12-13 03:05:47,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 947 flow [2022-12-13 03:05:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:05:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:05:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-12-13 03:05:47,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2022-12-13 03:05:47,900 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2022-12-13 03:05:47,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 63 transitions, 947 flow [2022-12-13 03:05:47,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 30 transitions, 424 flow [2022-12-13 03:05:47,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:47,903 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 424 flow [2022-12-13 03:05:47,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:47,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:47,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 424 flow [2022-12-13 03:05:47,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 30 transitions, 424 flow [2022-12-13 03:05:47,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 03:05:48,357 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:05:48,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-13 03:05:48,359 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 400 flow [2022-12-13 03:05:48,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 03:05:48,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:48,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:05:48,359 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 03:05:48,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:48,360 INFO L85 PathProgramCache]: Analyzing trace with hash -402340966, now seen corresponding path program 1 times [2022-12-13 03:05:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:48,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269264585] [2022-12-13 03:05:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:48,537 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 03:05:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269264585] [2022-12-13 03:05:48,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269264585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:48,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:48,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:05:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956431467] [2022-12-13 03:05:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:48,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:05:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:05:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:05:48,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-13 03:05:48,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 03:05:48,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:48,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-13 03:05:48,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:48,602 INFO L130 PetriNetUnfolder]: 31/95 cut-off events. [2022-12-13 03:05:48,602 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-13 03:05:48,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 95 events. 31/95 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 369 event pairs, 1 based on Foata normal form. 9/83 useless extension candidates. Maximal degree in co-relation 711. Up to 82 conditions per place. [2022-12-13 03:05:48,603 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 19 selfloop transitions, 0 changer transitions 17/41 dead transitions. [2022-12-13 03:05:48,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 680 flow [2022-12-13 03:05:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:05:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:05:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-13 03:05:48,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-13 03:05:48,605 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2022-12-13 03:05:48,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 680 flow [2022-12-13 03:05:48,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 24 transitions, 374 flow [2022-12-13 03:05:48,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:48,607 INFO L89 Accepts]: Start accepts. Operand has 42 places, 24 transitions, 374 flow [2022-12-13 03:05:48,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:48,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:48,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 374 flow [2022-12-13 03:05:48,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 374 flow [2022-12-13 03:05:48,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 03:05:48,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L789: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_21| |v_P1Thread1of1ForFork0_~arg#1.offset_21|) (= v_~x$r_buff0_thd2~0_136 1) (= v_~x$w_buff0~0_182 v_~x$w_buff1~0_141) (= v_~x$r_buff0_thd0~0_128 v_~x$r_buff1_thd0~0_134) (= v_~x$w_buff0_used~0_286 v_~x$w_buff1_used~0_243) (= |v_P1Thread1of1ForFork0_~arg#1.base_21| |v_P1Thread1of1ForFork0_#in~arg#1.base_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~y~0_44 1) (= v_~x$w_buff0_used~0_285 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_285 256) 0)) (not (= (mod v_~x$w_buff1_used~0_243 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~z~0_58 v_~__unbuffered_p1_EBX~0_110) (= v_~y~0_44 v_~__unbuffered_p1_EAX~0_100) (= v_~x$r_buff0_thd2~0_137 v_~x$r_buff1_thd2~0_103) (= v_~x$r_buff0_thd1~0_121 v_~x$r_buff1_thd1~0_125) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$w_buff0~0_181 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_182, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ~z~0=v_~z~0_58, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_286} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_21|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_110, ~x$w_buff1~0=v_~x$w_buff1~0_141, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_243, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_136, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_134, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_285, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_100, ~z~0=v_~z~0_58, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~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, ~y~0] and [323] $Ultimate##0-->L744: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~z~0_17 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 03:05:48,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:05:48,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 03:05:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 358 flow [2022-12-13 03:05:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 03:05:48,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:48,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:48,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:05:48,749 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 03:05:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash -409719834, now seen corresponding path program 1 times [2022-12-13 03:05:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:48,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107132992] [2022-12-13 03:05:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:05:49,089 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 03:05:49,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:05:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107132992] [2022-12-13 03:05:49,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107132992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:05:49,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:05:49,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:05:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472879677] [2022-12-13 03:05:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:05:49,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:05:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:05:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:05:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:05:49,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2022-12-13 03:05:49,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 03:05:49,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:05:49,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2022-12-13 03:05:49,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:05:49,159 INFO L130 PetriNetUnfolder]: 24/79 cut-off events. [2022-12-13 03:05:49,159 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-13 03:05:49,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 79 events. 24/79 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 302 event pairs, 0 based on Foata normal form. 9/70 useless extension candidates. Maximal degree in co-relation 638. Up to 70 conditions per place. [2022-12-13 03:05:49,160 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 14 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2022-12-13 03:05:49,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 634 flow [2022-12-13 03:05:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:05:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:05:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-13 03:05:49,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-13 03:05:49,162 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2022-12-13 03:05:49,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 35 transitions, 634 flow [2022-12-13 03:05:49,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 22 transitions, 374 flow [2022-12-13 03:05:49,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:05:49,163 INFO L89 Accepts]: Start accepts. Operand has 44 places, 22 transitions, 374 flow [2022-12-13 03:05:49,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:05:49,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:05:49,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 22 transitions, 374 flow [2022-12-13 03:05:49,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 22 transitions, 374 flow [2022-12-13 03:05:49,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-13 03:05:49,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [415] $Ultimate##0-->L760: Formula: (let ((.cse6 (= (mod v_~x$w_buff0_used~0_301 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_128 256) 0))) (let ((.cse7 (and .cse6 .cse4))) (let ((.cse0 (or .cse7 .cse4)) (.cse1 (not .cse4)) (.cse2 (not (= 0 (mod v_~weak$$choice2~0_60 256)))) (.cse5 (= (mod v_~x$w_buff1_used~0_251 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_299 256) 0))) (and (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= (ite .cse0 v_~x~0_219 (ite .cse1 1 v_~x$w_buff1~0_147)) v_~__unbuffered_p0_EAX~0_112) (= v_~x$r_buff0_thd2~0_150 1) (= v_~x$r_buff0_thd1~0_127 (ite .cse2 v_~x$r_buff0_thd1~0_128 (ite (or .cse3 .cse4 (and .cse5 .cse4)) v_~x$r_buff0_thd1~0_128 (ite (and (not .cse3) .cse1) 0 v_~x$r_buff0_thd1~0_128)))) (= v_~x$r_buff0_thd0~0_134 v_~x$r_buff1_thd0~0_140) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= (ite .cse2 v_~x$mem_tmp~0_60 v_~__unbuffered_p0_EAX~0_112) v_~x~0_218) (= |v_P0Thread1of1ForFork1_#t~nondet4_34| v_~weak$$choice2~0_60) (= v_~x$w_buff0~0_193 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| (ite .cse6 1 0)) (= v_~x$w_buff1_used~0_251 (ite .cse2 v_~x$w_buff0_used~0_301 (ite (or .cse7 .cse3 .cse4) v_~x$w_buff0_used~0_301 0))) (= |v_P0Thread1of1ForFork1_#t~nondet3_34| v_~weak$$choice0~0_33) (= v_~x$w_buff0_used~0_299 (ite .cse2 1 (ite .cse0 1 (ite .cse1 0 1)))) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= v_~x$r_buff0_thd2~0_151 v_~x$r_buff1_thd2~0_111) (= v_~z~0_66 1) (= v_~x$mem_tmp~0_60 v_~x~0_219) (= v_~x$w_buff0~0_195 v_~x$w_buff1~0_147) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_63 0) (= (ite .cse2 v_~x$r_buff0_thd1~0_128 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_127 256) 0))) (or (and .cse8 .cse5) (and .cse8 .cse4) .cse3)) v_~x$r_buff0_thd1~0_128 0)) v_~x$r_buff1_thd1~0_131) (= v_~y~0_50 v_~__unbuffered_p1_EAX~0_106) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~z~0_67 v_~__unbuffered_p1_EBX~0_116))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_195, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_151, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_34|, ~z~0=v_~z~0_67, ~x~0=v_~x~0_219, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_34|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_127, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_63, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_131, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_112, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~y~0=v_~y~0_50, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_116, ~x$w_buff1~0=v_~x$w_buff1~0_147, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_251, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_140, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_299, ~weak$$choice0~0=v_~weak$$choice0~0_33, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_60, ~x~0=v_~x~0_218} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~nondet3, ~z~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [284] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_107 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_108 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_108) v_~x$w_buff0_used~0_107) (= v_~x~0_76 (ite .cse0 v_~x$w_buff0~0_55 (ite .cse1 v_~x$w_buff1~0_44 v_~x~0_77))) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26) (= v_~x$w_buff1_used~0_92 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_108} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 03:05:50,109 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:05:50,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 947 [2022-12-13 03:05:50,110 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 21 transitions, 356 flow [2022-12-13 03:05:50,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 03:05:50,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:05:50,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:50,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:05:50,110 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 03:05:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:05:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -800364774, now seen corresponding path program 1 times [2022-12-13 03:05:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:05:50,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396473419] [2022-12-13 03:05:50,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:05:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:05:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:05:50,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:05:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:05:50,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:05:50,197 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:05:50,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 03:05:50,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 03:05:50,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 03:05:50,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 03:05:50,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 03:05:50,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:05:50,202 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:05:50,206 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:05:50,206 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:05:50,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:05:50 BasicIcfg [2022-12-13 03:05:50,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:05:50,264 INFO L158 Benchmark]: Toolchain (without parser) took 12348.33ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 154.8MB in the beginning and 190.5MB in the end (delta: -35.7MB). Peak memory consumption was 115.6MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,264 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory was 156.2MB in the beginning and 156.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:05:50,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.75ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 129.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.08ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 127.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,264 INFO L158 Benchmark]: Boogie Preprocessor took 45.15ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 125.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,265 INFO L158 Benchmark]: RCFGBuilder took 650.65ms. Allocated memory is still 180.4MB. Free memory was 125.8MB in the beginning and 96.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,265 INFO L158 Benchmark]: TraceAbstraction took 11025.08ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 95.4MB in the beginning and 190.5MB in the end (delta: -95.1MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. [2022-12-13 03:05:50,266 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.11ms. Allocated memory is still 180.4MB. Free memory was 156.2MB in the beginning and 156.0MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 551.75ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 129.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.08ms. Allocated memory is still 180.4MB. Free memory was 129.9MB in the beginning and 127.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.15ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 125.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 650.65ms. Allocated memory is still 180.4MB. Free memory was 125.8MB in the beginning and 96.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11025.08ms. Allocated memory was 180.4MB in the beginning and 330.3MB in the end (delta: 149.9MB). Free memory was 95.4MB in the beginning and 190.5MB in the end (delta: -95.1MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 94 PlacesBefore, 52 PlacesAfterwards, 89 TransitionsBefore, 46 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 4 ChoiceCompositions, 76 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1924, independent: 1830, independent conditional: 1830, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1924, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1924, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1924, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1107, independent: 1070, independent conditional: 0, independent unconditional: 1070, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1059, independent conditional: 0, independent unconditional: 1059, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1924, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 2155, Positive cache size: 2118, Positive conditional cache size: 0, Positive unconditional cache size: 2118, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.2s, 33 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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, 35 PlacesBefore, 35 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 12, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 6, Positive unconditional cache size: 11, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 17, Positive conditional cache size: 6, Positive unconditional cache size: 11, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 40 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 5, independent unconditional: 2, 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: 7, independent: 7, independent conditional: 4, 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: 7, independent: 7, independent conditional: 4, 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: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 24, Positive conditional cache size: 8, Positive unconditional cache size: 16, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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, 47 PlacesBefore, 47 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 92 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): 29, Positive cache size: 24, Positive conditional cache size: 8, Positive unconditional cache size: 16, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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.5s, 44 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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): 32, Positive cache size: 27, Positive conditional cache size: 8, Positive unconditional cache size: 19, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 32, Positive cache size: 27, Positive conditional cache size: 8, Positive unconditional cache size: 19, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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.9s, 44 PlacesBefore, 42 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 3 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: 0, independent unconditional: 2, 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: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 29, Positive conditional cache size: 8, Positive unconditional cache size: 21, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=0, t903={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, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=1, t903={5:0}, t904={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, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y [L788] 2 __unbuffered_p1_EBX = z [L743] 2 z = 1 [L746] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 2 x$flush_delayed = weak$$choice2 [L749] 2 x$mem_tmp = x [L750] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 2 __unbuffered_p0_EAX = x [L758] 2 x = x$flush_delayed ? x$mem_tmp : x [L759] 2 x$flush_delayed = (_Bool)0 [L791] 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) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 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 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 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 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 621 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 3 mSDtfsCounter, 621 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=6, InterpolantAutomatonStates: 50, 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, 2.0s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 03:05:50,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...