/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:09:32,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:09:32,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:09:32,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:09:32,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:09:32,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:09:32,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:09:32,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:09:32,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:09:32,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:09:32,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:09:32,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:09:32,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:09:32,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:09:32,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:09:32,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:09:32,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:09:32,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:09:32,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:09:32,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:09:32,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:09:32,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:09:32,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:09:32,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:09:32,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:09:32,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:09:32,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:09:32,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:09:32,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:09:32,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:09:32,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:09:32,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:09:32,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:09:32,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:09:32,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:09:32,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:09:32,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:09:32,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:09:32,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:09:32,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:09:32,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:09:32,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:09:32,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:09:32,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:09:32,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:09:32,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:09:32,741 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:09:32,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:09:32,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:09:32,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:09:32,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:09:32,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:09:32,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:09:32,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:09:32,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:09:32,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:09:32,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:09:32,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:09:32,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:09:32,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:09:32,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:09:32,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:09:32,996 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:09:32,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2022-12-05 23:09:33,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:09:34,177 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:09:34,178 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008.oepc.i [2022-12-05 23:09:34,190 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9918dba6a/3a477f155a084efbb8e6307ac3bc0cc3/FLAG6f9a2cdfc [2022-12-05 23:09:34,202 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9918dba6a/3a477f155a084efbb8e6307ac3bc0cc3 [2022-12-05 23:09:34,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:09:34,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:09:34,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:09:34,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:09:34,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:09:34,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1861d096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34, skipping insertion in model container [2022-12-05 23:09:34,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:09:34,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:09:34,356 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/rfi008.oepc.i[988,1001] [2022-12-05 23:09:34,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:09:34,495 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:09:34,504 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/rfi008.oepc.i[988,1001] [2022-12-05 23:09:34,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:09:34,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:09:34,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:09:34,579 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:09:34,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34 WrapperNode [2022-12-05 23:09:34,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:09:34,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:09:34,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:09:34,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:09:34,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,642 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-05 23:09:34,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:09:34,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:09:34,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:09:34,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:09:34,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,673 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:09:34,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:09:34,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:09:34,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:09:34,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (1/1) ... [2022-12-05 23:09:34,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:09:34,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:09:34,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:09:34,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:09:34,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:09:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:09:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:09:34,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:09:34,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:09:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:09:34,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:09:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:09:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:09:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:09:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:09:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:09:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:09:34,803 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:09:34,963 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:09:34,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:09:35,182 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:09:35,313 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:09:35,314 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:09:35,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:09:35 BoogieIcfgContainer [2022-12-05 23:09:35,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:09:35,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:09:35,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:09:35,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:09:35,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:09:34" (1/3) ... [2022-12-05 23:09:35,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e85c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:09:35, skipping insertion in model container [2022-12-05 23:09:35,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:09:34" (2/3) ... [2022-12-05 23:09:35,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e85c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:09:35, skipping insertion in model container [2022-12-05 23:09:35,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:09:35" (3/3) ... [2022-12-05 23:09:35,320 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2022-12-05 23:09:35,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:09:35,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:09:35,332 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:09:35,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:09:35,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-05 23:09:35,441 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-05 23:09:35,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:35,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:09:35,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-05 23:09:35,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-05 23:09:35,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:35,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-05 23:09:35,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-05 23:09:35,502 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-05 23:09:35,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:35,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 23:09:35,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-05 23:09:35,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 1188 [2022-12-05 23:09:38,942 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-05 23:09:38,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:09:38,956 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;@59593a60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:09:38,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:09:38,958 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-05 23:09:38,958 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:38,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:38,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:09:38,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash 446889, now seen corresponding path program 1 times [2022-12-05 23:09:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:38,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749160732] [2022-12-05 23:09:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:39,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749160732] [2022-12-05 23:09:39,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749160732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:39,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:39,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483295785] [2022-12-05 23:09:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:39,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:39,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:39,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 23:09:39,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:39,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:39,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 23:09:39,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:39,338 INFO L130 PetriNetUnfolder]: 228/410 cut-off events. [2022-12-05 23:09:39,338 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:09:39,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 410 events. 228/410 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1698 event pairs, 74 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 810. Up to 341 conditions per place. [2022-12-05 23:09:39,342 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 22 selfloop transitions, 2 changer transitions 6/32 dead transitions. [2022-12-05 23:09:39,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 133 flow [2022-12-05 23:09:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 23:09:39,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2022-12-05 23:09:39,351 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 41 transitions. [2022-12-05 23:09:39,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 133 flow [2022-12-05 23:09:39,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:39,354 INFO L231 Difference]: Finished difference. Result has 27 places, 17 transitions, 42 flow [2022-12-05 23:09:39,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2022-12-05 23:09:39,357 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:09:39,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:39,358 INFO L89 Accepts]: Start accepts. Operand has 27 places, 17 transitions, 42 flow [2022-12-05 23:09:39,359 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:39,359 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:39,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 17 transitions, 42 flow [2022-12-05 23:09:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2022-12-05 23:09:39,364 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 23:09:39,364 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:39,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:09:39,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 42 flow [2022-12-05 23:09:39,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-05 23:09:39,481 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:39,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-05 23:09:39,483 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-05 23:09:39,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:39,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:39,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:39,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:09:39,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash 403891810, now seen corresponding path program 1 times [2022-12-05 23:09:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:39,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034598711] [2022-12-05 23:09:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034598711] [2022-12-05 23:09:39,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034598711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:39,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:39,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222880923] [2022-12-05 23:09:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:39,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:39,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:09:39,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:39,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:39,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:09:39,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:39,763 INFO L130 PetriNetUnfolder]: 207/360 cut-off events. [2022-12-05 23:09:39,763 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 23:09:39,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1250 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2022-12-05 23:09:39,773 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2022-12-05 23:09:39,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2022-12-05 23:09:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:09:39,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-05 23:09:39,775 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:09:39,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2022-12-05 23:09:39,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:39,776 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2022-12-05 23:09:39,777 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2022-12-05 23:09:39,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:39,777 INFO L89 Accepts]: Start accepts. Operand has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,778 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:39,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:39,778 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,783 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-05 23:09:39,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:09:39,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 40. Up to 10 conditions per place. [2022-12-05 23:09:39,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 23:09:39,888 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:39,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-05 23:09:39,890 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2022-12-05 23:09:39,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:39,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:39,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:39,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:09:39,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1802335545, now seen corresponding path program 1 times [2022-12-05 23:09:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:39,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407644493] [2022-12-05 23:09:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:40,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407644493] [2022-12-05 23:09:40,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407644493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:40,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:40,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:09:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343150557] [2022-12-05 23:09:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:40,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:09:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:40,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:09:40,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:09:40,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-05 23:09:40,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:40,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-05 23:09:40,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:40,201 INFO L130 PetriNetUnfolder]: 157/280 cut-off events. [2022-12-05 23:09:40,201 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-05 23:09:40,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 280 events. 157/280 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 952 event pairs, 53 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 637. Up to 200 conditions per place. [2022-12-05 23:09:40,203 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2022-12-05 23:09:40,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 113 flow [2022-12-05 23:09:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 23:09:40,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-05 23:09:40,210 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 26 transitions. [2022-12-05 23:09:40,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 113 flow [2022-12-05 23:09:40,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:09:40,211 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-05 23:09:40,212 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-05 23:09:40,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:40,212 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,212 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:40,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:40,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,217 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-05 23:09:40,218 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-05 23:09:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 2/24 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 8 conditions per place. [2022-12-05 23:09:40,218 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,218 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-05 23:09:40,223 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:40,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-05 23:09:40,225 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2022-12-05 23:09:40,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,225 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:40,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:09:40,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1560799310, now seen corresponding path program 1 times [2022-12-05 23:09:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:40,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219352733] [2022-12-05 23:09:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219352733] [2022-12-05 23:09:40,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219352733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:40,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:40,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:09:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057493856] [2022-12-05 23:09:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:40,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:09:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:09:40,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:09:40,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-05 23:09:40,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:40,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-05 23:09:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:40,373 INFO L130 PetriNetUnfolder]: 179/316 cut-off events. [2022-12-05 23:09:40,373 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-05 23:09:40,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 316 events. 179/316 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1048 event pairs, 99 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 746. Up to 237 conditions per place. [2022-12-05 23:09:40,375 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-05 23:09:40,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 137 flow [2022-12-05 23:09:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:09:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:09:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-05 23:09:40,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-05 23:09:40,376 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 27 transitions. [2022-12-05 23:09:40,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 137 flow [2022-12-05 23:09:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:40,377 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-05 23:09:40,378 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2022-12-05 23:09:40,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:40,378 INFO L89 Accepts]: Start accepts. Operand has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,379 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:40,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:40,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,383 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-05 23:09:40,383 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-12-05 23:09:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 22 events. 1/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 35. Up to 6 conditions per place. [2022-12-05 23:09:40,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-05 23:09:40,394 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:40,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:09:40,395 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2022-12-05 23:09:40,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:40,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:40,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:09:40,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -677982961, now seen corresponding path program 1 times [2022-12-05 23:09:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:40,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718252943] [2022-12-05 23:09:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:40,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718252943] [2022-12-05 23:09:40,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718252943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:40,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:40,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:09:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713123820] [2022-12-05 23:09:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:40,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:09:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:09:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:09:40,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-05 23:09:40,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:40,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-05 23:09:40,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:40,705 INFO L130 PetriNetUnfolder]: 80/175 cut-off events. [2022-12-05 23:09:40,705 INFO L131 PetriNetUnfolder]: For 65/66 co-relation queries the response was YES. [2022-12-05 23:09:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 175 events. 80/175 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 635 event pairs, 35 based on Foata normal form. 28/197 useless extension candidates. Maximal degree in co-relation 423. Up to 85 conditions per place. [2022-12-05 23:09:40,706 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2022-12-05 23:09:40,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 190 flow [2022-12-05 23:09:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:09:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:09:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 23:09:40,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-05 23:09:40,708 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 4 states and 44 transitions. [2022-12-05 23:09:40,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 190 flow [2022-12-05 23:09:40,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:09:40,709 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-05 23:09:40,711 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-05 23:09:40,711 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:40,711 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,712 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:40,712 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:40,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,721 INFO L130 PetriNetUnfolder]: 4/33 cut-off events. [2022-12-05 23:09:40,721 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-12-05 23:09:40,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 33 events. 4/33 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 74. Up to 12 conditions per place. [2022-12-05 23:09:40,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 23:09:40,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:09:40,729 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:09:40,729 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 90 flow [2022-12-05 23:09:40,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:40,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:40,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:09:40,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 724372106, now seen corresponding path program 1 times [2022-12-05 23:09:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:40,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232386807] [2022-12-05 23:09:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:40,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:40,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232386807] [2022-12-05 23:09:40,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232386807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:40,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:40,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:09:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030142620] [2022-12-05 23:09:40,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:40,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:09:40,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:09:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:09:40,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-05 23:09:40,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:40,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:40,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-05 23:09:40,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:40,949 INFO L130 PetriNetUnfolder]: 32/86 cut-off events. [2022-12-05 23:09:40,949 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 23:09:40,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 86 events. 32/86 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 234 event pairs, 13 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 245. Up to 41 conditions per place. [2022-12-05 23:09:40,950 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 1/30 dead transitions. [2022-12-05 23:09:40,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 170 flow [2022-12-05 23:09:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:09:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:09:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-05 23:09:40,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4470588235294118 [2022-12-05 23:09:40,951 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 90 flow. Second operand 5 states and 38 transitions. [2022-12-05 23:09:40,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 170 flow [2022-12-05 23:09:40,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 148 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-05 23:09:40,953 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 94 flow [2022-12-05 23:09:40,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:09:40,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-05 23:09:40,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:40,955 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 94 flow [2022-12-05 23:09:40,956 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:40,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:40,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 94 flow [2022-12-05 23:09:40,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 94 flow [2022-12-05 23:09:40,961 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2022-12-05 23:09:40,961 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-05 23:09:40,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 24 events. 2/24 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2022-12-05 23:09:40,961 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 94 flow [2022-12-05 23:09:40,961 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:09:40,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L814-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [413] L834-3-->L837: Formula: (= v_~main$tmp_guard0~0_42 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:09:40,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [408] L778-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P0Thread1of1ForFork0_#res#1.offset_11|) (= |v_P0Thread1of1ForFork0_#res#1.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P0Thread1of1ForFork0_#res#1.offset=|v_P0Thread1of1ForFork0_#res#1.offset_11|, P0Thread1of1ForFork0_#res#1.base=|v_P0Thread1of1ForFork0_#res#1.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res#1.offset, P0Thread1of1ForFork0_#res#1.base, ~__unbuffered_cnt~0] and [413] L834-3-->L837: Formula: (= v_~main$tmp_guard0~0_42 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_15|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-05 23:09:41,583 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:09:41,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-05 23:09:41,583 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 86 flow [2022-12-05 23:09:41,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:41,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:41,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:41,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:09:41,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash 643175057, now seen corresponding path program 1 times [2022-12-05 23:09:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:41,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391411953] [2022-12-05 23:09:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391411953] [2022-12-05 23:09:42,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391411953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:42,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:42,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:09:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382484655] [2022-12-05 23:09:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:42,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:09:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:09:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:09:42,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 16 [2022-12-05 23:09:42,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:42,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:42,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 16 [2022-12-05 23:09:42,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:42,690 INFO L130 PetriNetUnfolder]: 27/84 cut-off events. [2022-12-05 23:09:42,690 INFO L131 PetriNetUnfolder]: For 111/112 co-relation queries the response was YES. [2022-12-05 23:09:42,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 84 events. 27/84 cut-off events. For 111/112 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 261 event pairs, 0 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 249. Up to 24 conditions per place. [2022-12-05 23:09:42,691 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 29 selfloop transitions, 8 changer transitions 6/46 dead transitions. [2022-12-05 23:09:42,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 298 flow [2022-12-05 23:09:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 23:09:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 23:09:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-12-05 23:09:42,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-05 23:09:42,695 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 86 flow. Second operand 8 states and 60 transitions. [2022-12-05 23:09:42,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 298 flow [2022-12-05 23:09:42,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 231 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-05 23:09:42,699 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 106 flow [2022-12-05 23:09:42,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 23:09:42,700 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-05 23:09:42,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:42,700 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 106 flow [2022-12-05 23:09:42,701 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:42,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:42,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 106 flow [2022-12-05 23:09:42,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 106 flow [2022-12-05 23:09:42,706 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-05 23:09:42,706 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 23:09:42,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 32 events. 3/32 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2022-12-05 23:09:42,706 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 106 flow [2022-12-05 23:09:42,706 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-05 23:09:43,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L807-->L814: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_48 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_52 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff1_thd2~0_47 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_51 256) 0)))) 0 v_~x$r_buff1_thd2~0_48)) (= v_~x$r_buff0_thd2~0_51 (ite .cse2 0 v_~x$r_buff0_thd2~0_52)) (= v_~x$w_buff1_used~0_90 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_91)) (= (ite .cse4 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x~0_54 (ite .cse4 v_~x$w_buff0~0_31 (ite .cse3 v_~x$w_buff1~0_32 v_~x~0_55)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_51, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [430] $Ultimate##0-->L768: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_128 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_467 256) 0))) (and (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_41| |v_P0Thread1of1ForFork0_~arg#1.offset_41|) (= (ite .cse0 v_~x$mem_tmp~0_94 v_~__unbuffered_p0_EAX~0_93) v_~x~0_376) (= v_~x$flush_delayed~0_108 0) (= v_~x$w_buff1_used~0_436 (ite .cse0 v_~x$w_buff0_used~0_469 (ite .cse1 v_~x$w_buff0_used~0_469 0))) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_467) (= (ite .cse0 v_~x$r_buff0_thd1~0_222 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_220 256) 0))) (or (and (= (mod v_~x$w_buff1_used~0_436 256) 0) .cse2) .cse1 (and (= (mod v_~x$r_buff0_thd1~0_222 256) 0) .cse2))) v_~x$r_buff0_thd1~0_222 0)) v_~x$r_buff1_thd1~0_181) (= v_~x$mem_tmp~0_94 v_~x~0_377) (= v_~x$r_buff0_thd1~0_220 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~x$r_buff0_thd2~0_219 v_~x$r_buff1_thd2~0_220) (= (ite (= (mod v_~x$w_buff0_used~0_469 256) 0) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$w_buff0~0_273 v_~x$w_buff1~0_254) (= v_~weak$$choice2~0_128 |v_P0Thread1of1ForFork0_#t~nondet4#1_38|) (= |v_P0Thread1of1ForFork0_~arg#1.base_41| |v_P0Thread1of1ForFork0_#in~arg#1.base_41|) (= v_~x$w_buff0~0_271 1) (= v_~x$r_buff0_thd0~0_170 v_~x$r_buff1_thd0~0_172) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= |v_P0Thread1of1ForFork0_#t~nondet3#1_38| v_~weak$$choice0~0_82) (= v_~x$w_buff0~0_271 v_~__unbuffered_p0_EAX~0_93))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_273, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_170, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_222, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_41|, P0Thread1of1ForFork0_#t~nondet4#1=|v_P0Thread1of1ForFork0_#t~nondet4#1_38|, P0Thread1of1ForFork0_#t~nondet3#1=|v_P0Thread1of1ForFork0_#t~nondet3#1_38|, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_219, ~x~0=v_~x~0_377, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_469} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_271, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_170, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_41|, ~x$flush_delayed~0=v_~x$flush_delayed~0_108, ~x$w_buff1~0=v_~x$w_buff1~0_254, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_41|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_436, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_220, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_181, ~x$mem_tmp~0=v_~x$mem_tmp~0_94, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_219, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_467, ~weak$$choice0~0=v_~weak$$choice0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_93, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, ~weak$$choice2~0=v_~weak$$choice2~0_128, ~x~0=v_~x~0_376, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, P0Thread1of1ForFork0_#t~nondet4#1, ~x$w_buff1~0, P0Thread1of1ForFork0_~arg#1.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg#1.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_#t~nondet3#1, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] [2022-12-05 23:09:43,593 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:09:43,594 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 894 [2022-12-05 23:09:43,594 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 101 flow [2022-12-05 23:09:43,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:43,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:43,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:43,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:09:43,595 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1772433021, now seen corresponding path program 1 times [2022-12-05 23:09:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:43,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521010664] [2022-12-05 23:09:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:09:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:09:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:09:43,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521010664] [2022-12-05 23:09:43,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521010664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:09:43,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:09:43,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:09:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624241271] [2022-12-05 23:09:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:09:43,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:09:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:09:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:09:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:09:43,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 23:09:43,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 101 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:43,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:09:43,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 23:09:43,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:09:43,880 INFO L130 PetriNetUnfolder]: 37/105 cut-off events. [2022-12-05 23:09:43,880 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-05 23:09:43,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 105 events. 37/105 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 5 based on Foata normal form. 4/109 useless extension candidates. Maximal degree in co-relation 330. Up to 43 conditions per place. [2022-12-05 23:09:43,881 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 14 selfloop transitions, 3 changer transitions 18/35 dead transitions. [2022-12-05 23:09:43,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 235 flow [2022-12-05 23:09:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:09:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:09:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-05 23:09:43,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-05 23:09:43,882 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 101 flow. Second operand 6 states and 36 transitions. [2022-12-05 23:09:43,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 235 flow [2022-12-05 23:09:43,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 216 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 23:09:43,883 INFO L231 Difference]: Finished difference. Result has 36 places, 15 transitions, 76 flow [2022-12-05 23:09:43,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=15} [2022-12-05 23:09:43,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-05 23:09:43,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:09:43,884 INFO L89 Accepts]: Start accepts. Operand has 36 places, 15 transitions, 76 flow [2022-12-05 23:09:43,884 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:09:43,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:09:43,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 15 transitions, 76 flow [2022-12-05 23:09:43,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 15 transitions, 76 flow [2022-12-05 23:09:43,888 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-05 23:09:43,888 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:09:43,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 22 events. 1/22 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2022-12-05 23:09:43,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 15 transitions, 76 flow [2022-12-05 23:09:43,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 30 [2022-12-05 23:09:44,433 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:09:44,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 549 [2022-12-05 23:09:44,434 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 12 transitions, 70 flow [2022-12-05 23:09:44,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:09:44,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:09:44,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:44,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:09:44,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:09:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:09:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1504405532, now seen corresponding path program 1 times [2022-12-05 23:09:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:09:44,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289516532] [2022-12-05 23:09:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:09:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:09:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:09:44,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:09:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:09:44,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:09:44,502 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:09:44,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:09:44,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:09:44,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:09:44,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:09:44,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:09:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:09:44,504 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:09:44,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:09:44,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:09:44,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:09:44 BasicIcfg [2022-12-05 23:09:44,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:09:44,575 INFO L158 Benchmark]: Toolchain (without parser) took 10370.23ms. Allocated memory was 255.9MB in the beginning and 476.1MB in the end (delta: 220.2MB). Free memory was 208.3MB in the beginning and 446.1MB in the end (delta: -237.8MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,575 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 231.5MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:09:44,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.56ms. Allocated memory is still 255.9MB. Free memory was 208.3MB in the beginning and 217.7MB in the end (delta: -9.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.82ms. Allocated memory is still 255.9MB. Free memory was 217.7MB in the beginning and 215.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,576 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 255.9MB. Free memory was 215.1MB in the beginning and 213.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,576 INFO L158 Benchmark]: RCFGBuilder took 638.09ms. Allocated memory is still 255.9MB. Free memory was 213.0MB in the beginning and 226.8MB in the end (delta: -13.8MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,576 INFO L158 Benchmark]: TraceAbstraction took 9258.03ms. Allocated memory was 255.9MB in the beginning and 476.1MB in the end (delta: 220.2MB). Free memory was 226.3MB in the beginning and 446.1MB in the end (delta: -219.8MB). Peak memory consumption was 41.8MB. Max. memory is 8.0GB. [2022-12-05 23:09:44,577 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.10ms. Allocated memory is still 255.9MB. Free memory was 231.7MB in the beginning and 231.5MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.56ms. Allocated memory is still 255.9MB. Free memory was 208.3MB in the beginning and 217.7MB in the end (delta: -9.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.82ms. Allocated memory is still 255.9MB. Free memory was 217.7MB in the beginning and 215.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 255.9MB. Free memory was 215.1MB in the beginning and 213.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 638.09ms. Allocated memory is still 255.9MB. Free memory was 213.0MB in the beginning and 226.8MB in the end (delta: -13.8MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9258.03ms. Allocated memory was 255.9MB in the beginning and 476.1MB in the end (delta: 220.2MB). Free memory was 226.3MB in the beginning and 446.1MB in the end (delta: -219.8MB). Peak memory consumption was 41.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 95 PlacesBefore, 29 PlacesAfterwards, 90 TransitionsBefore, 23 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 986, independent: 938, independent conditional: 938, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 986, independent: 938, independent conditional: 0, independent unconditional: 938, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 986, independent: 938, independent conditional: 0, independent unconditional: 938, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 986, independent: 938, independent conditional: 0, independent unconditional: 938, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 722, independent: 689, independent conditional: 0, independent unconditional: 689, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 722, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 986, independent: 249, independent conditional: 0, independent unconditional: 249, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 722, unknown conditional: 0, unknown unconditional: 722] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1110, Positive conditional cache size: 0, Positive unconditional cache size: 1110, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 63, 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: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 11, independent unconditional: 52, dependent: 20, dependent conditional: 7, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 71, independent: 54, independent conditional: 9, independent unconditional: 45, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 71, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 112, dependent conditional: 56, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 71, unknown conditional: 15, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 54, Positive conditional cache size: 9, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, 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, 27 PlacesBefore, 27 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 67, Positive conditional cache size: 9, Positive unconditional cache size: 58, Negative cache size: 27, Negative conditional cache size: 6, Negative unconditional cache size: 21, 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, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 67, Positive conditional cache size: 9, Positive unconditional cache size: 58, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, 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, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 22, independent conditional: 9, independent unconditional: 13, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 22, independent conditional: 3, independent unconditional: 19, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 22, independent conditional: 3, independent unconditional: 19, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 72, Positive conditional cache size: 9, Positive unconditional cache size: 63, Negative cache size: 30, Negative conditional cache size: 6, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 33 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 8, independent unconditional: 46, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 90, Positive conditional cache size: 10, Positive unconditional cache size: 80, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 67, independent conditional: 25, independent unconditional: 42, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 67, independent conditional: 25, independent unconditional: 42, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 67, independent conditional: 25, independent unconditional: 42, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 63, independent conditional: 22, independent unconditional: 41, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 114, Positive conditional cache size: 13, Positive unconditional cache size: 101, Negative cache size: 33, Negative conditional cache size: 7, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 33 PlacesBefore, 30 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 30 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 131, Positive conditional cache size: 15, Positive unconditional cache size: 116, Negative cache size: 35, Negative conditional cache size: 9, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=0, t1721={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] [L833] 0 pthread_t t1722; [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=1, t1721={5:0}, t1722={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] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 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) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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)) [L763] 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)) [L764] 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)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 y = 1 [L790] 2 __unbuffered_p1_EAX = y [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 1 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 1 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 1 !(!cond) [L838] RET 1 assume_abort_if_not(main$tmp_guard0) [L840] 1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 1 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 [L843] 1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 1 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 [L847] 1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 1 !expression [L19] 1 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 834]: 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: 832]: 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, 112 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: 9.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 6 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 35, 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.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 597 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-05 23:09:44,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...