/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -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-8d0d62b [2022-12-06 06:24:05,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:24:05,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:24:05,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:24:05,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:24:05,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:24:05,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:24:05,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:24:05,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:24:05,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:24:05,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:24:05,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:24:05,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:24:05,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:24:05,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:24:05,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:24:05,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:24:05,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:24:05,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:24:05,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:24:05,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:24:05,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:24:05,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:24:05,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:24:05,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:24:05,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:24:05,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:24:05,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:24:05,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:24:05,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:24:05,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:24:05,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:24:05,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:24:05,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:24:05,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:24:05,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:24:05,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:24:05,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:24:05,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:24:05,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:24:05,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:24:05,509 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:24:05,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:24:05,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:24:05,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:24:05,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:24:05,541 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:24:05,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:24:05,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:24:05,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:24:05,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:24:05,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:24:05,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:24:05,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:24:05,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:24:05,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:24:05,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:24:05,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:05,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:24:05,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:24:05,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:24:05,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:24:05,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:24:05,545 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:24:05,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:24:05,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:24:05,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:24:05,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:24:05,891 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:24:05,891 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:24:05,892 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-06 06:24:06,913 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:24:07,228 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:24:07,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2022-12-06 06:24:07,241 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268eacd19/70547fb48b3f44df84ca16bdebfe64df/FLAG819a6e58d [2022-12-06 06:24:07,259 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268eacd19/70547fb48b3f44df84ca16bdebfe64df [2022-12-06 06:24:07,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:24:07,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:24:07,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:07,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:24:07,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:24:07,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4493bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07, skipping insertion in model container [2022-12-06 06:24:07,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:24:07,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:24:07,499 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-06 06:24:07,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:07,694 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:24:07,706 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-06 06:24:07,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:07,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:07,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:07,813 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:24:07,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07 WrapperNode [2022-12-06 06:24:07,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:07,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:07,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:24:07,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:24:07,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,855 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-12-06 06:24:07,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:07,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:24:07,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:24:07,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:24:07,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,876 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:24:07,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:24:07,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:24:07,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:24:07,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (1/1) ... [2022-12-06 06:24:07,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:24:07,908 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-06 06:24:07,922 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-06 06:24:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:24:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:24:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:24:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:24:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:24:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:24:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:24:07,953 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:24:08,075 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:24:08,077 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:24:08,305 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:24:08,468 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:24:08,469 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:24:08,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:08 BoogieIcfgContainer [2022-12-06 06:24:08,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:24:08,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:24:08,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:24:08,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:24:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:24:07" (1/3) ... [2022-12-06 06:24:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498097f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:08, skipping insertion in model container [2022-12-06 06:24:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:07" (2/3) ... [2022-12-06 06:24:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498097f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:08, skipping insertion in model container [2022-12-06 06:24:08,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:08" (3/3) ... [2022-12-06 06:24:08,478 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2022-12-06 06:24:08,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:24:08,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:24:08,518 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:24:08,630 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:24:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:24:08,733 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:24:08,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:08,737 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-06 06:24:08,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:24:08,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-06 06:24:08,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:08,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:24:08,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-06 06:24:08,855 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:24:08,855 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:08,856 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-06 06:24:08,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:24:08,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-06 06:24:12,859 INFO L203 LiptonReduction]: Total number of compositions: 72 [2022-12-06 06:24:12,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:24:12,886 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;@58f3e29c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:24:12,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:24:12,889 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:24:12,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:12,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:12,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:24:12,892 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-06 06:24:12,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 384908072, now seen corresponding path program 1 times [2022-12-06 06:24:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546889707] [2022-12-06 06:24:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:13,309 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-06 06:24:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546889707] [2022-12-06 06:24:13,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546889707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:13,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:13,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901441481] [2022-12-06 06:24:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:13,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:13,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:13,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:13,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:24:13,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:13,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:24:13,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:13,486 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-12-06 06:24:13,486 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:24:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1285 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-12-06 06:24:13,491 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 06:24:13,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-12-06 06:24:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 06:24:13,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 06:24:13,504 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 06:24:13,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-12-06 06:24:13,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:13,509 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-06 06:24:13,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-06 06:24:13,514 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-06 06:24:13,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:13,515 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-06 06:24:13,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:13,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:13,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-06 06:24:13,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 06:24:13,532 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:24:13,532 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:13,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:24:13,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 06:24:13,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:24:13,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:13,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 06:24:13,746 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 36 flow [2022-12-06 06:24:13,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:13,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:13,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:24:13,750 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-06 06:24:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash 529482343, now seen corresponding path program 1 times [2022-12-06 06:24:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:13,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687290281] [2022-12-06 06:24:13,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:13,903 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-06 06:24:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:13,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687290281] [2022-12-06 06:24:13,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687290281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:13,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:13,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961534342] [2022-12-06 06:24:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:13,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:13,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 06:24:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 36 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 06:24:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:13,960 INFO L130 PetriNetUnfolder]: 80/161 cut-off events. [2022-12-06 06:24:13,960 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:24:13,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 161 events. 80/161 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 523 event pairs, 20 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 326. Up to 117 conditions per place. [2022-12-06 06:24:13,967 INFO L137 encePairwiseOnDemand]: 11/14 looper letters, 16 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-06 06:24:13,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 82 flow [2022-12-06 06:24:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-06 06:24:13,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 06:24:13,968 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 36 flow. Second operand 3 states and 22 transitions. [2022-12-06 06:24:13,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 82 flow [2022-12-06 06:24:13,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:13,969 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2022-12-06 06:24:13,970 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2022-12-06 06:24:13,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:13,971 INFO L89 Accepts]: Start accepts. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:13,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:13,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,976 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 06:24:13,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:13,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:24:13,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,977 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 06:24:13,991 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:13,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 06:24:13,993 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow [2022-12-06 06:24:13,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:13,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:13,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:13,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:24:13,994 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-06 06:24:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -765915693, now seen corresponding path program 1 times [2022-12-06 06:24:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:13,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336116995] [2022-12-06 06:24:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:14,215 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-06 06:24:14,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:14,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336116995] [2022-12-06 06:24:14,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336116995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:14,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:14,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:14,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192948244] [2022-12-06 06:24:14,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:14,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:14,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:14,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 06:24:14,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:14,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:14,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 06:24:14,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:14,307 INFO L130 PetriNetUnfolder]: 49/113 cut-off events. [2022-12-06 06:24:14,307 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:24:14,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 113 events. 49/113 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 356 event pairs, 11 based on Foata normal form. 16/129 useless extension candidates. Maximal degree in co-relation 253. Up to 54 conditions per place. [2022-12-06 06:24:14,310 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2022-12-06 06:24:14,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 161 flow [2022-12-06 06:24:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:24:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:24:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 06:24:14,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-06 06:24:14,317 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 5 states and 41 transitions. [2022-12-06 06:24:14,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 161 flow [2022-12-06 06:24:14,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:14,319 INFO L231 Difference]: Finished difference. Result has 27 places, 16 transitions, 63 flow [2022-12-06 06:24:14,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=16} [2022-12-06 06:24:14,320 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 06:24:14,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:14,321 INFO L89 Accepts]: Start accepts. Operand has 27 places, 16 transitions, 63 flow [2022-12-06 06:24:14,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:14,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:14,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 16 transitions, 63 flow [2022-12-06 06:24:14,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 63 flow [2022-12-06 06:24:14,330 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-06 06:24:14,330 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:24:14,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 26 events. 5/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 55. Up to 12 conditions per place. [2022-12-06 06:24:14,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 63 flow [2022-12-06 06:24:14,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:24:14,334 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:14,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:24:14,335 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 63 flow [2022-12-06 06:24:14,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:14,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:14,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:14,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:24:14,336 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-06 06:24:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2101076021, now seen corresponding path program 1 times [2022-12-06 06:24:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:14,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260422800] [2022-12-06 06:24:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:14,530 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-06 06:24:14,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:14,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260422800] [2022-12-06 06:24:14,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260422800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:14,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:14,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422171716] [2022-12-06 06:24:14,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:14,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:24:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:24:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:24:14,534 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-06 06:24:14,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 06:24:14,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:14,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-06 06:24:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:14,601 INFO L130 PetriNetUnfolder]: 20/58 cut-off events. [2022-12-06 06:24:14,601 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 06:24:14,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 58 events. 20/58 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 156. Up to 24 conditions per place. [2022-12-06 06:24:14,602 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 16 selfloop transitions, 5 changer transitions 7/29 dead transitions. [2022-12-06 06:24:14,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 159 flow [2022-12-06 06:24:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:24:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:24:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-06 06:24:14,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 06:24:14,605 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 63 flow. Second operand 6 states and 36 transitions. [2022-12-06 06:24:14,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 159 flow [2022-12-06 06:24:14,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 140 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 06:24:14,608 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 70 flow [2022-12-06 06:24:14,608 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2022-12-06 06:24:14,609 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 06:24:14,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:14,609 INFO L89 Accepts]: Start accepts. Operand has 30 places, 16 transitions, 70 flow [2022-12-06 06:24:14,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:14,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:14,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 70 flow [2022-12-06 06:24:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 70 flow [2022-12-06 06:24:14,616 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 06:24:14,616 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 06:24:14,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 1/16 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 06:24:14,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 70 flow [2022-12-06 06:24:14,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 06:24:15,005 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:24:15,006 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-06 06:24:15,006 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 14 transitions, 66 flow [2022-12-06 06:24:15,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 06:24:15,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:15,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:15,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:24:15,007 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-06 06:24:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:15,007 INFO L85 PathProgramCache]: Analyzing trace with hash 649455993, now seen corresponding path program 1 times [2022-12-06 06:24:15,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:15,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063017299] [2022-12-06 06:24:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:15,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:15,527 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-06 06:24:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:15,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063017299] [2022-12-06 06:24:15,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063017299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:15,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:15,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:24:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088089043] [2022-12-06 06:24:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:15,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:24:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:15,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:24:15,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:24:15,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-06 06:24:15,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 14 transitions, 66 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:15,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:15,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-06 06:24:15,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:15,661 INFO L130 PetriNetUnfolder]: 23/65 cut-off events. [2022-12-06 06:24:15,662 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-06 06:24:15,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 65 events. 23/65 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 171 event pairs, 5 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 180. Up to 31 conditions per place. [2022-12-06 06:24:15,662 INFO L137 encePairwiseOnDemand]: 5/12 looper letters, 15 selfloop transitions, 9 changer transitions 10/34 dead transitions. [2022-12-06 06:24:15,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 213 flow [2022-12-06 06:24:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:24:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:24:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-12-06 06:24:15,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-06 06:24:15,665 INFO L175 Difference]: Start difference. First operand has 26 places, 14 transitions, 66 flow. Second operand 8 states and 31 transitions. [2022-12-06 06:24:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 213 flow [2022-12-06 06:24:15,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 186 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 06:24:15,668 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 103 flow [2022-12-06 06:24:15,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:24:15,671 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-06 06:24:15,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:15,671 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 103 flow [2022-12-06 06:24:15,672 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:15,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:15,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 103 flow [2022-12-06 06:24:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 103 flow [2022-12-06 06:24:15,678 INFO L130 PetriNetUnfolder]: 4/26 cut-off events. [2022-12-06 06:24:15,678 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:24:15,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 26 events. 4/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 62. Up to 7 conditions per place. [2022-12-06 06:24:15,678 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 103 flow [2022-12-06 06:24:15,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 06:24:15,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L786-->L789: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~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-06 06:24:16,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $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_15 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_15, 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] and [378] $Ultimate##0-->L786: Formula: (and (= v_~y~0_26 1) (= v_~x$r_buff0_thd2~0_114 1) (= v_~y~0_26 v_~__unbuffered_p1_EAX~0_66) (= v_~x$w_buff0_used~0_251 1) (= v_~x$w_buff0_used~0_252 v_~x$w_buff1_used~0_212) (= v_~x$w_buff0~0_160 v_~x$w_buff1~0_125) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_18| |v_P1Thread1of1ForFork0_#in~arg#1.base_18|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_251 256) 0)) (not (= (mod v_~x$w_buff1_used~0_212 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28|) (= v_~x$w_buff0~0_159 1) (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff1_thd0~0_115) (= v_~x$r_buff1_thd2~0_86 v_~x$r_buff0_thd2~0_115) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_18| |v_P1Thread1of1ForFork0_~arg#1.offset_18|) (= v_~x$r_buff0_thd1~0_115 v_~x$r_buff1_thd1~0_119)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_160, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_252} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_159, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_28|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_18|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_86, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_119, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_28|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_115, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_251, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_66, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, ~y~0] [2022-12-06 06:24:16,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] $Ultimate##0-->L786: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~x$r_buff0_thd1~0_151 v_~x$r_buff1_thd1~0_157) (= v_~y~0_35 v_~__unbuffered_p1_EAX~0_81) (= v_~x$w_buff0_used~0_314 1) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_268 256) 0)) (not (= (mod v_~x$w_buff0_used~0_314 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~z~0_46 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= v_~x$w_buff0_used~0_315 v_~x$w_buff1_used~0_268) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_~y~0_35 1) (= v_~x$r_buff0_thd2~0_141 v_~x$r_buff1_thd2~0_103) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|) (= v_~x$w_buff0~0_210 v_~x$w_buff1~0_169) (= v_~x$w_buff0~0_209 1) (= v_~x$r_buff0_thd2~0_140 1) (= v_~x$r_buff0_thd0~0_136 v_~x$r_buff1_thd0~0_140)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_210, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_141, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_209, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_151, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_169, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_103, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_268, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_157, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~z~0=v_~z~0_46, ~y~0=v_~y~0_35} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~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-06 06:24:17,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] $Ultimate##0-->L796: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_330 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_332 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0)))) (and (= v_~x$r_buff0_thd2~0_152 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_33| |v_P1Thread1of1ForFork0_~arg#1.offset_33|) (= |v_P1Thread1of1ForFork0_~arg#1.base_33| |v_P1Thread1of1ForFork0_#in~arg#1.base_33|) (= v_~y~0_41 1) (= v_~x$w_buff0_used~0_330 0) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd0~0_142 v_~x$r_buff1_thd0~0_146) (= v_~x$w_buff0~0_225 v_~x~0_251) (= v_~x$r_buff1_thd2~0_109 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_152 256) 0)) .cse0) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_278 256) 0)))) 0 v_~x$r_buff0_thd2~0_154)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_87) (= v_~__unbuffered_p1_EBX~0_85 v_~z~0_52) (= v_~x$w_buff0~0_226 v_~x$w_buff1~0_179) (= v_~x$w_buff0~0_225 1) (= v_~x$r_buff0_thd1~0_161 v_~x$r_buff1_thd1~0_167) (= v_~z~0_52 1) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= v_~x$w_buff1_used~0_278 (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~x$w_buff0_used~0_332)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_226, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_161, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_332} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_225, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_161, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_33|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_87, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~y~0=v_~y~0_41, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_142, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_33|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_179, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_278, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_152, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_146, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_330, ~z~0=v_~z~0_52, ~x~0=v_~x~0_251} 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, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, ~y~0, ~x~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-06 06:24:17,843 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:24:17,844 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2173 [2022-12-06 06:24:17,844 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 99 flow [2022-12-06 06:24:17,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:17,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:17,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:17,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:24:17,845 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-06 06:24:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash -824308993, now seen corresponding path program 1 times [2022-12-06 06:24:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542111838] [2022-12-06 06:24:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:17,994 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-06 06:24:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:17,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542111838] [2022-12-06 06:24:17,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542111838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:17,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:17,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954405518] [2022-12-06 06:24:17,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:17,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:17,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:24:17,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 99 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:17,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:17,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:24:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:18,052 INFO L130 PetriNetUnfolder]: 15/45 cut-off events. [2022-12-06 06:24:18,052 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-06 06:24:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 45 events. 15/45 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 154. Up to 23 conditions per place. [2022-12-06 06:24:18,053 INFO L137 encePairwiseOnDemand]: 6/15 looper letters, 15 selfloop transitions, 5 changer transitions 6/26 dead transitions. [2022-12-06 06:24:18,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 193 flow [2022-12-06 06:24:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:24:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:24:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-12-06 06:24:18,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2022-12-06 06:24:18,054 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 99 flow. Second operand 5 states and 23 transitions. [2022-12-06 06:24:18,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 193 flow [2022-12-06 06:24:18,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 155 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 06:24:18,058 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 79 flow [2022-12-06 06:24:18,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2022-12-06 06:24:18,060 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 06:24:18,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:18,060 INFO L89 Accepts]: Start accepts. Operand has 28 places, 16 transitions, 79 flow [2022-12-06 06:24:18,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:18,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:18,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 79 flow [2022-12-06 06:24:18,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 79 flow [2022-12-06 06:24:18,066 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-06 06:24:18,066 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:24:18,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 26 events. 3/26 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 58. Up to 7 conditions per place. [2022-12-06 06:24:18,067 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 79 flow [2022-12-06 06:24:18,067 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 06:24:18,342 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:24:18,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-06 06:24:18,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 16 transitions, 87 flow [2022-12-06 06:24:18,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:18,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:18,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:18,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:24:18,344 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-06 06:24:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1921383479, now seen corresponding path program 2 times [2022-12-06 06:24:18,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604647964] [2022-12-06 06:24:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:18,465 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-06 06:24:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:18,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604647964] [2022-12-06 06:24:18,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604647964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:18,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:18,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674068188] [2022-12-06 06:24:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:18,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:18,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:24:18,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 16 transitions, 87 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:18,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:18,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:24:18,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:18,519 INFO L130 PetriNetUnfolder]: 13/49 cut-off events. [2022-12-06 06:24:18,520 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 06:24:18,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 49 events. 13/49 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 3 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 168. Up to 22 conditions per place. [2022-12-06 06:24:18,520 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 13 selfloop transitions, 1 changer transitions 9/23 dead transitions. [2022-12-06 06:24:18,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 163 flow [2022-12-06 06:24:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:24:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:24:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-12-06 06:24:18,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 06:24:18,522 INFO L175 Difference]: Start difference. First operand has 28 places, 16 transitions, 87 flow. Second operand 4 states and 20 transitions. [2022-12-06 06:24:18,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 163 flow [2022-12-06 06:24:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 145 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:24:18,524 INFO L231 Difference]: Finished difference. Result has 29 places, 12 transitions, 56 flow [2022-12-06 06:24:18,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=29, PETRI_TRANSITIONS=12} [2022-12-06 06:24:18,524 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-06 06:24:18,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:18,525 INFO L89 Accepts]: Start accepts. Operand has 29 places, 12 transitions, 56 flow [2022-12-06 06:24:18,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:18,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:18,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 12 transitions, 56 flow [2022-12-06 06:24:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 12 transitions, 56 flow [2022-12-06 06:24:18,529 INFO L130 PetriNetUnfolder]: 1/12 cut-off events. [2022-12-06 06:24:18,529 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:24:18,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 12 events. 1/12 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2022-12-06 06:24:18,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 12 transitions, 56 flow [2022-12-06 06:24:18,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-06 06:24:18,530 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:18,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:24:18,533 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 12 transitions, 56 flow [2022-12-06 06:24:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:18,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:18,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:18,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:24:18,533 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-06 06:24:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash -734369964, now seen corresponding path program 1 times [2022-12-06 06:24:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881788160] [2022-12-06 06:24:18,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:19,004 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-06 06:24:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:19,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881788160] [2022-12-06 06:24:19,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881788160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:19,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:19,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58688653] [2022-12-06 06:24:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:19,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:24:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:24:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:24:19,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-06 06:24:19,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 12 transitions, 56 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:19,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:19,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-06 06:24:19,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:19,070 INFO L130 PetriNetUnfolder]: 4/22 cut-off events. [2022-12-06 06:24:19,070 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 06:24:19,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 22 events. 4/22 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-06 06:24:19,071 INFO L137 encePairwiseOnDemand]: 5/10 looper letters, 9 selfloop transitions, 4 changer transitions 5/18 dead transitions. [2022-12-06 06:24:19,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 18 transitions, 124 flow [2022-12-06 06:24:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:24:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:24:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-12-06 06:24:19,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 06:24:19,072 INFO L175 Difference]: Start difference. First operand has 25 places, 12 transitions, 56 flow. Second operand 6 states and 15 transitions. [2022-12-06 06:24:19,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 18 transitions, 124 flow [2022-12-06 06:24:19,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 18 transitions, 118 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:24:19,073 INFO L231 Difference]: Finished difference. Result has 28 places, 12 transitions, 63 flow [2022-12-06 06:24:19,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=12} [2022-12-06 06:24:19,074 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 06:24:19,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:19,074 INFO L89 Accepts]: Start accepts. Operand has 28 places, 12 transitions, 63 flow [2022-12-06 06:24:19,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:19,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:19,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 12 transitions, 63 flow [2022-12-06 06:24:19,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 12 transitions, 63 flow [2022-12-06 06:24:19,078 INFO L130 PetriNetUnfolder]: 1/14 cut-off events. [2022-12-06 06:24:19,078 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:24:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 14 events. 1/14 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2022-12-06 06:24:19,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 12 transitions, 63 flow [2022-12-06 06:24:19,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 06:24:19,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [392] L789-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_130 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_179 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_370 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_371 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_313 256) 0)) .cse3))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_313) v_~x$w_buff1_used~0_312) (= v_~x$r_buff1_thd2~0_129 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_178 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_312 256) 0)))) 0 v_~x$r_buff1_thd2~0_130)) (= (ite .cse4 0 v_~x$w_buff0_used~0_371) v_~x$w_buff0_used~0_370) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= v_~x$r_buff0_thd2~0_178 (ite .cse1 0 v_~x$r_buff0_thd2~0_179)) (= |v_P1Thread1of1ForFork0_#res#1.offset_27| 0) (= (ite .cse4 v_~x$w_buff0~0_257 (ite .cse0 v_~x$w_buff1~0_205 v_~x~0_284)) v_~x~0_283) (= |v_P1Thread1of1ForFork0_#res#1.base_27| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$w_buff1~0=v_~x$w_buff1~0_205, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_130, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_313, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_179, ~x~0=v_~x~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_371} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_257, ~x$w_buff1~0=v_~x$w_buff1~0_205, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_129, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_312, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_27|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_27|, ~x~0=v_~x~0_283, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_370} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [380] L816-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_133 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_302 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_303 256))))) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_257 256) 0)) .cse4))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| 0)) (= (ite .cse0 0 v_~x$w_buff0_used~0_303) v_~x$w_buff0_used~0_302) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_257) v_~x$w_buff1_used~0_256) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27| (mod v_~main$tmp_guard0~0_50 256)) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|) (= v_~main$tmp_guard0~0_50 (ite (= (ite (= v_~__unbuffered_cnt~0_113 2) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_136 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_132 256) 0)) .cse3) (and (not (= 0 (mod v_~x$w_buff1_used~0_256 256))) .cse4)) 0 v_~x$r_buff1_thd0~0_137)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|) (= v_~x$r_buff0_thd0~0_132 (ite .cse1 0 v_~x$r_buff0_thd0~0_133)) (= (ite .cse0 v_~x$w_buff0~0_201 (ite .cse2 v_~x$w_buff1~0_161 v_~x~0_232)) v_~x~0_231) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_77 0) (= v_~__unbuffered_p0_EAX~0_107 0) (= v_~__unbuffered_p1_EAX~0_79 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_201, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_161, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_257, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_137, ~x~0=v_~x~0_232, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_303} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_201, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_132, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_77, ~x$w_buff1~0=v_~x$w_buff1~0_161, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_256, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_50, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_302, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_55|, ~x~0=v_~x~0_231, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:24:19,938 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:24:19,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 865 [2022-12-06 06:24:19,939 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 11 transitions, 74 flow [2022-12-06 06:24:19,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:19,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:19,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:19,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:24:19,940 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-06 06:24:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 529514893, now seen corresponding path program 1 times [2022-12-06 06:24:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174239300] [2022-12-06 06:24:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:19,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:24:19,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:24:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:24:20,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:24:20,006 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:24:20,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:24:20,008 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:24:20,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:24:20,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:24:20,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:24:20,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:24:20,009 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:20,014 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:24:20,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:24:20,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:24:20 BasicIcfg [2022-12-06 06:24:20,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:24:20,042 INFO L158 Benchmark]: Toolchain (without parser) took 12779.77ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 160.0MB in the beginning and 193.4MB in the end (delta: -33.4MB). Peak memory consumption was 143.3MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:24:20,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.12ms. Allocated memory is still 184.5MB. Free memory was 159.5MB in the beginning and 134.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.80ms. Allocated memory is still 184.5MB. Free memory was 134.9MB in the beginning and 132.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,043 INFO L158 Benchmark]: Boogie Preprocessor took 23.23ms. Allocated memory is still 184.5MB. Free memory was 132.2MB in the beginning and 130.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,043 INFO L158 Benchmark]: RCFGBuilder took 591.06ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 101.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,044 INFO L158 Benchmark]: TraceAbstraction took 11569.17ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 100.8MB in the beginning and 193.4MB in the end (delta: -92.6MB). Peak memory consumption was 83.6MB. Max. memory is 8.0GB. [2022-12-06 06:24:20,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.12ms. Allocated memory is still 184.5MB. Free memory was 159.5MB in the beginning and 134.9MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.80ms. Allocated memory is still 184.5MB. Free memory was 134.9MB in the beginning and 132.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.23ms. Allocated memory is still 184.5MB. Free memory was 132.2MB in the beginning and 130.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 591.06ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 101.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11569.17ms. Allocated memory was 184.5MB in the beginning and 358.6MB in the end (delta: 174.1MB). Free memory was 100.8MB in the beginning and 193.4MB in the end (delta: -92.6MB). Peak memory consumption was 83.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 94 PlacesBefore, 26 PlacesAfterwards, 89 TransitionsBefore, 20 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 0, independent unconditional: 792, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 701, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 701, independent: 661, independent conditional: 0, independent unconditional: 661, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 836, independent: 122, independent conditional: 0, independent unconditional: 122, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 701, unknown conditional: 0, unknown unconditional: 701] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1057, Positive conditional cache size: 0, Positive unconditional cache size: 1057, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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, 22 PlacesBefore, 21 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 11, dependent conditional: 2, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 87, dependent conditional: 19, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 25, independent conditional: 1, independent unconditional: 24, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 39, unknown conditional: 4, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 28, Positive conditional cache size: 2, Positive unconditional cache size: 26, Negative cache size: 11, Negative conditional cache size: 2, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 1, independent unconditional: 21, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 34, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 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] ], Cache Queries: [ total: 34, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 28 PlacesBefore, 26 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 46, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 34, Positive conditional cache size: 2, Positive unconditional cache size: 32, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 31 PlacesBefore, 27 PlacesAfterwards, 21 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 11, independent conditional: 2, independent unconditional: 9, 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: 23, independent: 11, independent conditional: 2, independent unconditional: 9, 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: 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: 23, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 35, Positive conditional cache size: 2, Positive unconditional cache size: 33, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 28 PlacesBefore, 28 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 3, Positive unconditional cache size: 39, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 12 TransitionsBefore, 12 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 42, Positive conditional cache size: 3, Positive unconditional cache size: 39, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 27 PlacesBefore, 26 PlacesAfterwards, 12 TransitionsBefore, 11 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 48, Positive conditional cache size: 4, Positive unconditional cache size: 44, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 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))=-1, 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))=0, 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 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}, main$tmp_guard0=0, main$tmp_guard1=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=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 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] 1 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] 1 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] 1 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] 1 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] 1 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] 1 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] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 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 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L820] RET 2 assume_abort_if_not(main$tmp_guard0) [L822] 2 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] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 2 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] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 2 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] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __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: 11.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:24:20,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...