/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:09,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:09,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:09,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:09,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:09,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:09,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:09,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:09,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:09,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:09,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:09,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:09,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:09,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:09,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:09,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:09,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:09,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:09,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:09,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:09,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:09,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:09,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:09,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:09,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:09,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:09,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:09,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:09,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:09,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:09,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:09,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:09,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:09,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:09,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:09,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:09,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:09,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:09,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:09,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:09,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:09,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:09,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:09,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:09,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:09,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:09,601 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:09,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:09,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:09,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:09,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:09,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:09,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:09,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:09,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:09,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:09,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:09,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:09,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:09,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:18:10,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:10,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:10,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:10,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:10,147 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:10,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-12-06 06:18:11,756 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:18:12,688 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:18:12,689 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-12-06 06:18:12,751 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3c79520/ec3df909f081499297f4e36c6a6fa4c6/FLAGe4582248e [2022-12-06 06:18:12,795 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3c79520/ec3df909f081499297f4e36c6a6fa4c6 [2022-12-06 06:18:12,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:18:12,798 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:18:12,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:12,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:18:12,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:18:12,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:12" (1/1) ... [2022-12-06 06:18:12,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3621842f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:12, skipping insertion in model container [2022-12-06 06:18:12,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:12" (1/1) ... [2022-12-06 06:18:12,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:18:12,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:18:13,208 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/mix012_pso.opt_tso.opt.i[999,1012] [2022-12-06 06:18:13,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:13,687 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:18:13,713 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/mix012_pso.opt_tso.opt.i[999,1012] [2022-12-06 06:18:13,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:13,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:13,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:13,860 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:18:13,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13 WrapperNode [2022-12-06 06:18:13,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:13,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:13,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:18:13,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:18:13,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:13,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:13,970 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-06 06:18:13,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:13,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:18:13,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:18:13,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:18:13,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:13,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:13,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:13,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:18:14,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:18:14,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:18:14,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:18:14,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (1/1) ... [2022-12-06 06:18:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:14,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:14,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:18:14,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:18:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:18:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:18:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:18:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:18:14,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:18:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:18:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:18:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:18:14,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:18:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:18:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:18:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:18:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:18:14,202 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:18:14,400 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:18:14,401 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:18:15,072 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:18:15,527 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:18:15,527 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:18:15,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:15 BoogieIcfgContainer [2022-12-06 06:18:15,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:18:15,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:18:15,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:18:15,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:18:15,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:18:12" (1/3) ... [2022-12-06 06:18:15,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc7c2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:15, skipping insertion in model container [2022-12-06 06:18:15,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:13" (2/3) ... [2022-12-06 06:18:15,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc7c2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:15, skipping insertion in model container [2022-12-06 06:18:15,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:15" (3/3) ... [2022-12-06 06:18:15,544 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2022-12-06 06:18:15,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:18:15,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:18:15,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:18:15,660 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:18:15,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:18:15,831 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:18:15,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:15,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:18:15,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-06 06:18:15,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-06 06:18:15,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:15,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:18:15,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-06 06:18:15,946 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-06 06:18:15,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:15,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-06 06:18:15,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-06 06:18:15,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-06 06:18:24,479 INFO L203 LiptonReduction]: Total number of compositions: 70 [2022-12-06 06:18:24,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:18:24,528 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;@49e582bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:18:24,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:18:24,539 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 06:18:24,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:24,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:24,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:18:24,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 403226483, now seen corresponding path program 1 times [2022-12-06 06:18:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:24,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54345536] [2022-12-06 06:18:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54345536] [2022-12-06 06:18:25,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54345536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:25,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:25,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102845932] [2022-12-06 06:18:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:25,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:25,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:25,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:18:25,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:25,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:25,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:18:25,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:25,757 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-12-06 06:18:25,761 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:18:25,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1257 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-12-06 06:18:25,779 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-06 06:18:25,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-12-06 06:18:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 06:18:25,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 06:18:25,789 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 06:18:25,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-12-06 06:18:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:25,809 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-06 06:18:25,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-06 06:18:25,813 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-06 06:18:25,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:25,814 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-06 06:18:25,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:25,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:25,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-06 06:18:25,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-06 06:18:25,828 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:18:25,829 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:25,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:18:25,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-06 06:18:25,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 06:18:26,131 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:26,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-06 06:18:26,134 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 38 flow [2022-12-06 06:18:26,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:26,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:26,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:26,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:18:26,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 953621070, now seen corresponding path program 1 times [2022-12-06 06:18:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:26,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555942193] [2022-12-06 06:18:26,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:26,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:26,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555942193] [2022-12-06 06:18:26,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555942193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:26,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:26,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998199353] [2022-12-06 06:18:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:26,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:26,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:26,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:18:26,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:26,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:26,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:18:26,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:26,714 INFO L130 PetriNetUnfolder]: 97/190 cut-off events. [2022-12-06 06:18:26,715 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:18:26,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 190 events. 97/190 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 608 event pairs, 37 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 384. Up to 117 conditions per place. [2022-12-06 06:18:26,718 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-06 06:18:26,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 86 flow [2022-12-06 06:18:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 06:18:26,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 06:18:26,720 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 38 flow. Second operand 3 states and 23 transitions. [2022-12-06 06:18:26,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 86 flow [2022-12-06 06:18:26,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:26,721 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-06 06:18:26,722 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-06 06:18:26,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:26,722 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:26,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:26,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,726 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:18:26,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:26,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:18:26,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 06:18:26,741 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:26,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:18:26,743 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-06 06:18:26,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:26,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:26,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:18:26,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1602409379, now seen corresponding path program 1 times [2022-12-06 06:18:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475821604] [2022-12-06 06:18:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:26,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475821604] [2022-12-06 06:18:26,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475821604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:26,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:26,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013564196] [2022-12-06 06:18:26,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:26,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:18:26,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 06:18:26,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:26,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:18:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:27,124 INFO L130 PetriNetUnfolder]: 60/134 cut-off events. [2022-12-06 06:18:27,125 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:18:27,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 134 events. 60/134 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 424 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 295. Up to 60 conditions per place. [2022-12-06 06:18:27,126 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-12-06 06:18:27,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 39 transitions, 177 flow [2022-12-06 06:18:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:18:27,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:18:27,128 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:18:27,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 39 transitions, 177 flow [2022-12-06 06:18:27,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:27,129 INFO L231 Difference]: Finished difference. Result has 28 places, 17 transitions, 65 flow [2022-12-06 06:18:27,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2022-12-06 06:18:27,129 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 06:18:27,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:27,130 INFO L89 Accepts]: Start accepts. Operand has 28 places, 17 transitions, 65 flow [2022-12-06 06:18:27,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:27,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:27,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 17 transitions, 65 flow [2022-12-06 06:18:27,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 65 flow [2022-12-06 06:18:27,134 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 06:18:27,134 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:18:27,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 27 events. 5/27 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 56. Up to 12 conditions per place. [2022-12-06 06:18:27,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 65 flow [2022-12-06 06:18:27,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-06 06:18:27,146 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:27,147 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 06:18:27,147 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 65 flow [2022-12-06 06:18:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-06 06:18:27,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:27,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:18:27,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1457906451, now seen corresponding path program 1 times [2022-12-06 06:18:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565981037] [2022-12-06 06:18:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:27,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:27,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565981037] [2022-12-06 06:18:27,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565981037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:27,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:27,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011917225] [2022-12-06 06:18:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:27,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:27,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:18:27,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:27,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:27,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:18:27,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:27,496 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-06 06:18:27,496 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:18:27,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 177. Up to 29 conditions per place. [2022-12-06 06:18:27,497 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2022-12-06 06:18:27,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 171 flow [2022-12-06 06:18:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:18:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:18:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 06:18:27,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 06:18:27,498 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 65 flow. Second operand 6 states and 39 transitions. [2022-12-06 06:18:27,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 171 flow [2022-12-06 06:18:27,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 152 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:27,500 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 72 flow [2022-12-06 06:18:27,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2022-12-06 06:18:27,501 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-06 06:18:27,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:27,501 INFO L89 Accepts]: Start accepts. Operand has 31 places, 17 transitions, 72 flow [2022-12-06 06:18:27,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:27,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:27,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 17 transitions, 72 flow [2022-12-06 06:18:27,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 17 transitions, 72 flow [2022-12-06 06:18:27,505 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-06 06:18:27,506 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 06:18:27,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 17 events. 1/17 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 06:18:27,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 72 flow [2022-12-06 06:18:27,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 06:18:28,462 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:18:28,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 962 [2022-12-06 06:18:28,463 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 68 flow [2022-12-06 06:18:28,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:28,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:28,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:28,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:18:28,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1963253262, now seen corresponding path program 1 times [2022-12-06 06:18:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:28,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439561161] [2022-12-06 06:18:28,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:28,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439561161] [2022-12-06 06:18:28,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439561161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:28,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:28,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:28,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207459907] [2022-12-06 06:18:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:28,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:28,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:28,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:18:28,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-06 06:18:28,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:28,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:18:28,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:28,698 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-06 06:18:28,699 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 06:18:28,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 67 events. 24/67 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 189 event pairs, 0 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 184. Up to 43 conditions per place. [2022-12-06 06:18:28,699 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 16 selfloop transitions, 1 changer transitions 11/28 dead transitions. [2022-12-06 06:18:28,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 177 flow [2022-12-06 06:18:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 06:18:28,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-06 06:18:28,700 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 68 flow. Second operand 4 states and 25 transitions. [2022-12-06 06:18:28,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 177 flow [2022-12-06 06:18:28,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 152 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 06:18:28,702 INFO L231 Difference]: Finished difference. Result has 27 places, 15 transitions, 59 flow [2022-12-06 06:18:28,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=15} [2022-12-06 06:18:28,703 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 06:18:28,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:28,703 INFO L89 Accepts]: Start accepts. Operand has 27 places, 15 transitions, 59 flow [2022-12-06 06:18:28,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:28,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:28,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 15 transitions, 59 flow [2022-12-06 06:18:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 59 flow [2022-12-06 06:18:28,707 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:18:28,707 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:18:28,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 18 events. 1/18 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2022-12-06 06:18:28,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 59 flow [2022-12-06 06:18:28,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 06:18:29,799 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:29,800 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-06 06:18:29,800 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 57 flow [2022-12-06 06:18:29,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-06 06:18:29,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:29,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:29,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:18:29,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -253232436, now seen corresponding path program 1 times [2022-12-06 06:18:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:29,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503252511] [2022-12-06 06:18:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503252511] [2022-12-06 06:18:32,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503252511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:32,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:32,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:18:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235621029] [2022-12-06 06:18:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:32,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:18:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:18:32,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:18:32,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 12 [2022-12-06 06:18:32,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 57 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-06 06:18:32,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:32,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 12 [2022-12-06 06:18:32,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:32,374 INFO L130 PetriNetUnfolder]: 12/42 cut-off events. [2022-12-06 06:18:32,374 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 06:18:32,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 42 events. 12/42 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 4 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 125. Up to 14 conditions per place. [2022-12-06 06:18:32,375 INFO L137 encePairwiseOnDemand]: 6/12 looper letters, 9 selfloop transitions, 5 changer transitions 9/24 dead transitions. [2022-12-06 06:18:32,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 156 flow [2022-12-06 06:18:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:18:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:18:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-12-06 06:18:32,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 06:18:32,376 INFO L175 Difference]: Start difference. First operand has 25 places, 14 transitions, 57 flow. Second operand 7 states and 27 transitions. [2022-12-06 06:18:32,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 156 flow [2022-12-06 06:18:32,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 150 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:32,378 INFO L231 Difference]: Finished difference. Result has 30 places, 14 transitions, 68 flow [2022-12-06 06:18:32,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=68, PETRI_PLACES=30, PETRI_TRANSITIONS=14} [2022-12-06 06:18:32,378 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 06:18:32,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:32,378 INFO L89 Accepts]: Start accepts. Operand has 30 places, 14 transitions, 68 flow [2022-12-06 06:18:32,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:32,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:32,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 14 transitions, 68 flow [2022-12-06 06:18:32,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 14 transitions, 68 flow [2022-12-06 06:18:32,382 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:18:32,382 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-06 06:18:32,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 18 events. 1/18 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 41. Up to 6 conditions per place. [2022-12-06 06:18:32,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 14 transitions, 68 flow [2022-12-06 06:18:32,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 06:18:32,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L797-->P1EXIT: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_164 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_203 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_406 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_407 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_370 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_203) v_~x$r_buff0_thd2~0_202) (= v_~x$w_buff1_used~0_369 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_370)) (= v_~x$w_buff0_used~0_406 (ite .cse2 0 v_~x$w_buff0_used~0_407)) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= (ite .cse2 v_~x$w_buff0~0_294 (ite .cse1 v_~x$w_buff1~0_271 v_~x~0_330)) v_~x~0_329) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_202 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_369 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_164) v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork0_#res#1.base_19| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_19| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_294, ~x$w_buff1~0=v_~x$w_buff1~0_271, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_370, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_203, ~x~0=v_~x~0_330, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_407} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_294, ~x$w_buff1~0=v_~x$w_buff1~0_271, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_369, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_202, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_19|, ~x~0=v_~x~0_329, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_406} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [402] L824-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd0~0_102 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_105 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_358 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~x$w_buff0_used~0_359 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_324 256) 0))))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_60 1) (= v_~__unbuffered_p0_EAX~0_98 0) (= v_~__unbuffered_p1_EBX~0_50 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_42) (= (mod v_~main$tmp_guard0~0_54 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53| 0) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_323 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_104 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_102) v_~x$r_buff1_thd0~0_101) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_105) v_~x$r_buff0_thd0~0_104) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|) (= v_~main$tmp_guard0~0_54 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_99) 1 0) 0) 0 1)) (= (ite .cse3 0 v_~x$w_buff0_used~0_359) v_~x$w_buff0_used~0_358) (= (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_324) v_~x$w_buff1_used~0_323) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_55| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| (mod v_~main$tmp_guard1~0_42 256)) (= (ite .cse3 v_~x$w_buff0~0_254 (ite .cse4 v_~x$w_buff1~0_233 v_~x~0_286)) v_~x~0_285)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_254, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_233, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_324, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_102, ~x~0=v_~x~0_286, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_359} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_254, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_49|, ~x$w_buff1~0=v_~x$w_buff1~0_233, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_358, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_98, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_55|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, ~x~0=v_~x~0_285, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_37|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:18:35,323 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:18:35,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2946 [2022-12-06 06:18:35,324 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 12 transitions, 74 flow [2022-12-06 06:18:35,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-06 06:18:35,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:35,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:18:35,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 06:18:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -501900999, now seen corresponding path program 1 times [2022-12-06 06:18:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272677275] [2022-12-06 06:18:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:18:35,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:18:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:18:35,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:18:35,561 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:18:35,562 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:18:35,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:18:35,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:18:35,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:18:35,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:18:35,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:18:35,564 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:35,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:18:35,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:18:35,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:18:35 BasicIcfg [2022-12-06 06:18:35,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:18:35,719 INFO L158 Benchmark]: Toolchain (without parser) took 22920.47ms. Allocated memory was 166.7MB in the beginning and 376.4MB in the end (delta: 209.7MB). Free memory was 141.2MB in the beginning and 219.8MB in the end (delta: -78.6MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,719 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 166.7MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:18:35,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1060.68ms. Allocated memory is still 166.7MB. Free memory was 140.7MB in the beginning and 114.3MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.23ms. Allocated memory is still 166.7MB. Free memory was 114.3MB in the beginning and 111.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,721 INFO L158 Benchmark]: Boogie Preprocessor took 63.27ms. Allocated memory is still 166.7MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,721 INFO L158 Benchmark]: RCFGBuilder took 1494.27ms. Allocated memory was 166.7MB in the beginning and 253.8MB in the end (delta: 87.0MB). Free memory was 109.7MB in the beginning and 226.0MB in the end (delta: -116.2MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,721 INFO L158 Benchmark]: TraceAbstraction took 20188.03ms. Allocated memory was 253.8MB in the beginning and 376.4MB in the end (delta: 122.7MB). Free memory was 225.5MB in the beginning and 219.8MB in the end (delta: 5.6MB). Peak memory consumption was 129.4MB. Max. memory is 8.0GB. [2022-12-06 06:18:35,722 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.23ms. Allocated memory is still 166.7MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1060.68ms. Allocated memory is still 166.7MB. Free memory was 140.7MB in the beginning and 114.3MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 108.23ms. Allocated memory is still 166.7MB. Free memory was 114.3MB in the beginning and 111.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.27ms. Allocated memory is still 166.7MB. Free memory was 111.8MB in the beginning and 109.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1494.27ms. Allocated memory was 166.7MB in the beginning and 253.8MB in the end (delta: 87.0MB). Free memory was 109.7MB in the beginning and 226.0MB in the end (delta: -116.2MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. * TraceAbstraction took 20188.03ms. Allocated memory was 253.8MB in the beginning and 376.4MB in the end (delta: 122.7MB). Free memory was 225.5MB in the beginning and 219.8MB in the end (delta: 5.6MB). Peak memory consumption was 129.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 92 PlacesBefore, 26 PlacesAfterwards, 87 TransitionsBefore, 20 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 764, independent: 723, independent conditional: 723, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 764, independent: 723, independent conditional: 0, independent unconditional: 723, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 764, independent: 723, independent conditional: 0, independent unconditional: 723, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 764, independent: 723, independent conditional: 0, independent unconditional: 723, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 610, independent: 584, independent conditional: 0, independent unconditional: 584, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 610, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 764, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 610, unknown conditional: 0, unknown unconditional: 610] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 879, Positive conditional cache size: 0, Positive unconditional cache size: 879, Negative cache size: 26, Negative conditional cache size: 0, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 22 PlacesBefore, 22 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 28, independent conditional: 28, 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: 44, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 28, independent conditional: 2, independent unconditional: 26, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 24, independent conditional: 2, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 299, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 283, dependent conditional: 32, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 37, unknown conditional: 4, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 13, Negative conditional cache size: 2, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 23 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 2, independent unconditional: 23, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 26, Positive conditional cache size: 2, Positive unconditional cache size: 24, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 25, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 28, Positive conditional cache size: 2, Positive unconditional cache size: 26, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, 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: 1.0s, 29 PlacesBefore, 27 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 30, Positive conditional cache size: 2, Positive unconditional cache size: 28, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, 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: 1.1s, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 26, independent conditional: 26, 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: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 227, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 21, independent conditional: 2, independent unconditional: 19, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 40, Positive conditional cache size: 7, Positive unconditional cache size: 33, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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: 2.9s, 29 PlacesBefore, 26 PlacesAfterwards, 14 TransitionsBefore, 12 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 53, Positive conditional cache size: 14, Positive unconditional cache size: 39, Negative cache size: 28, Negative conditional cache size: 6, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L821] 0 pthread_t t311; [L822] FCALL, FORK 0 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t311, ((void *)0), P0, ((void *)0))=-1, t311={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] [L823] 0 pthread_t t312; [L824] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t312, ((void *)0), P1, ((void *)0))=0, t311={5:0}, t312={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] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 1 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff0_thd2 = (_Bool)1 [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 x$flush_delayed = weak$$choice2 [L783] 2 x$mem_tmp = x [L784] 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) [L785] 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)) [L786] 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)) [L787] 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)) [L788] 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)) [L789] 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)) [L790] 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)) [L791] 2 __unbuffered_p1_EAX = x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 1 y = 1 [L744] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 1 x$flush_delayed = weak$$choice2 [L747] 1 x$mem_tmp = x [L748] 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) [L749] 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)) [L750] 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)) [L751] 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)) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 1 __unbuffered_p0_EAX = x [L756] 1 x = x$flush_delayed ? x$mem_tmp : x [L757] 1 x$flush_delayed = (_Bool)0 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L799] 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) [L800] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L803] 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 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L826] 2 main$tmp_guard0 = __unbuffered_cnt == 2 [L828] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L828] RET 2 assume_abort_if_not(main$tmp_guard0) [L830] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L837] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=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: 822]: 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: 824]: 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, 107 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: 19.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:18:35,819 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...