/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-RepeatedSemanticLbeWithPredicates.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-a802222-m [2022-12-13 09:19:18,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:19:18,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:19:18,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:19:18,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:19:18,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:19:18,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:19:18,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:19:18,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:19:18,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:19:18,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:19:18,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:19:18,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:19:18,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:19:18,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:19:18,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:19:18,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:19:18,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:19:18,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:19:18,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:19:18,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:19:18,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:19:18,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:19:18,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:19:18,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:19:18,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:19:18,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:19:18,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:19:18,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:19:18,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:19:18,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:19:18,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:19:18,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:19:18,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:19:18,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:19:18,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:19:18,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:19:18,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:19:18,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:19:18,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:19:18,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:19:18,795 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:19:18,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:19:18,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:19:18,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:19:18,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:19:18,853 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:19:18,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:19:18,853 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:19:18,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:19:18,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:19:18,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:19:18,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:19:18,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:19:18,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:19:18,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:19:18,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:19:18,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:18,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:19:18,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:19:18,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:19:18,857 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:19:18,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:19:18,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:19:18,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:19:18,857 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-13 09:19:19,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:19:19,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:19:19,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:19:19,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:19:19,170 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:19:19,171 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-13 09:19:20,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:19:20,712 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:19:20,712 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt_tso.opt.i [2022-12-13 09:19:20,733 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd488f1d/7e8d44a83d6d427fb4ae9bb6f9c53878/FLAGf9934f467 [2022-12-13 09:19:20,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd488f1d/7e8d44a83d6d427fb4ae9bb6f9c53878 [2022-12-13 09:19:20,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:19:20,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:19:20,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:20,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:19:20,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:19:20,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:20" (1/1) ... [2022-12-13 09:19:20,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1f8cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:20, skipping insertion in model container [2022-12-13 09:19:20,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:20" (1/1) ... [2022-12-13 09:19:20,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:19:20,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:19:20,929 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-13 09:19:21,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:21,152 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:19:21,164 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-13 09:19:21,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:21,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:21,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:21,274 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:19:21,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21 WrapperNode [2022-12-13 09:19:21,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:21,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:21,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:19:21,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:19:21,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,349 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-13 09:19:21,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:21,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:19:21,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:19:21,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:19:21,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,385 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:19:21,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:19:21,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:19:21,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:19:21,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (1/1) ... [2022-12-13 09:19:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:19:21,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:19:21,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:19:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:19:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:19:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:19:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:19:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:19:21,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:19:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:19:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:19:21,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:19:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:19:21,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:19:21,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:19:21,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:19:21,476 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:19:21,597 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:19:21,599 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:19:21,942 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:19:22,116 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:19:22,116 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:19:22,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:22 BoogieIcfgContainer [2022-12-13 09:19:22,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:19:22,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:19:22,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:19:22,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:19:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:19:20" (1/3) ... [2022-12-13 09:19:22,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:22, skipping insertion in model container [2022-12-13 09:19:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:21" (2/3) ... [2022-12-13 09:19:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:22, skipping insertion in model container [2022-12-13 09:19:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:22" (3/3) ... [2022-12-13 09:19:22,128 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt_tso.opt.i [2022-12-13 09:19:22,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:19:22,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:19:22,145 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:19:22,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:19:22,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 09:19:22,289 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 09:19:22,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:22,295 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-13 09:19:22,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 09:19:22,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-13 09:19:22,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:22,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 09:19:22,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-13 09:19:22,358 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 09:19:22,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:22,359 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-13 09:19:22,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 09:19:22,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-13 09:19:26,480 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-13 09:19:26,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:26,499 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;@20678d02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:26,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:19:26,503 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 09:19:26,503 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:26,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:26,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:19:26,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash 423568939, now seen corresponding path program 1 times [2022-12-13 09:19:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:26,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562126287] [2022-12-13 09:19:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:26,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562126287] [2022-12-13 09:19:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562126287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:26,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:26,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887104864] [2022-12-13 09:19:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:26,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 45 [2022-12-13 09:19:26,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:26,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:26,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 45 [2022-12-13 09:19:26,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:27,265 INFO L130 PetriNetUnfolder]: 1106/2051 cut-off events. [2022-12-13 09:19:27,265 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:19:27,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 2051 events. 1106/2051 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12827 event pairs, 96 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 3864. Up to 1586 conditions per place. [2022-12-13 09:19:27,273 INFO L137 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 2 changer transitions 38/68 dead transitions. [2022-12-13 09:19:27,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 264 flow [2022-12-13 09:19:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-13 09:19:27,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-13 09:19:27,286 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 3 states and 87 transitions. [2022-12-13 09:19:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 264 flow [2022-12-13 09:19:27,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:27,291 INFO L231 Difference]: Finished difference. Result has 49 places, 23 transitions, 54 flow [2022-12-13 09:19:27,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=49, PETRI_TRANSITIONS=23} [2022-12-13 09:19:27,298 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 09:19:27,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:27,299 INFO L89 Accepts]: Start accepts. Operand has 49 places, 23 transitions, 54 flow [2022-12-13 09:19:27,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:27,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:27,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 23 transitions, 54 flow [2022-12-13 09:19:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2022-12-13 09:19:27,313 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-13 09:19:27,313 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 39 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:19:27,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 54 flow [2022-12-13 09:19:27,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 09:19:27,422 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:27,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 09:19:27,424 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2022-12-13 09:19:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:27,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:27,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:19:27,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -972105538, now seen corresponding path program 1 times [2022-12-13 09:19:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:27,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153599720] [2022-12-13 09:19:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153599720] [2022-12-13 09:19:27,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153599720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:27,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:27,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560062678] [2022-12-13 09:19:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:27,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2022-12-13 09:19:27,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:27,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2022-12-13 09:19:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:27,684 INFO L130 PetriNetUnfolder]: 206/406 cut-off events. [2022-12-13 09:19:27,684 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 09:19:27,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 406 events. 206/406 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1718 event pairs, 66 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 789. Up to 256 conditions per place. [2022-12-13 09:19:27,686 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 20 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2022-12-13 09:19:27,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 116 flow [2022-12-13 09:19:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 09:19:27,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 09:19:27,690 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 3 states and 43 transitions. [2022-12-13 09:19:27,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 116 flow [2022-12-13 09:19:27,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:27,691 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 56 flow [2022-12-13 09:19:27,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-13 09:19:27,692 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -20 predicate places. [2022-12-13 09:19:27,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:27,692 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 56 flow [2022-12-13 09:19:27,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:27,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:27,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 56 flow [2022-12-13 09:19:27,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 09:19:27,698 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 09:19:27,699 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 39 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-13 09:19:27,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 09:19:27,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 09:19:27,781 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:27,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 09:19:27,783 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 56 flow [2022-12-13 09:19:27,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:27,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:27,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:19:27,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2110238765, now seen corresponding path program 1 times [2022-12-13 09:19:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:27,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048593769] [2022-12-13 09:19:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048593769] [2022-12-13 09:19:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048593769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377859679] [2022-12-13 09:19:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:27,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:27,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:27,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:19:27,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:27,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:27,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:19:27,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:28,072 INFO L130 PetriNetUnfolder]: 174/365 cut-off events. [2022-12-13 09:19:28,072 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 09:19:28,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 365 events. 174/365 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1657 event pairs, 37 based on Foata normal form. 42/313 useless extension candidates. Maximal degree in co-relation 788. Up to 244 conditions per place. [2022-12-13 09:19:28,074 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 24 selfloop transitions, 7 changer transitions 23/58 dead transitions. [2022-12-13 09:19:28,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 247 flow [2022-12-13 09:19:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 09:19:28,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2022-12-13 09:19:28,076 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 56 flow. Second operand 5 states and 76 transitions. [2022-12-13 09:19:28,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 247 flow [2022-12-13 09:19:28,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:28,077 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:28,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-13 09:19:28,078 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -16 predicate places. [2022-12-13 09:19:28,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:28,078 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:28,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:28,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:28,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 115 flow [2022-12-13 09:19:28,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:28,090 INFO L130 PetriNetUnfolder]: 45/118 cut-off events. [2022-12-13 09:19:28,090 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 09:19:28,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 118 events. 45/118 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 556 event pairs, 18 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 299. Up to 76 conditions per place. [2022-12-13 09:19:28,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:28,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 09:19:28,127 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:28,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 09:19:28,128 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 115 flow [2022-12-13 09:19:28,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:28,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:28,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:28,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:19:28,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1858868619, now seen corresponding path program 1 times [2022-12-13 09:19:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523699407] [2022-12-13 09:19:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:28,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523699407] [2022-12-13 09:19:28,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523699407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:28,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:28,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:28,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581417949] [2022-12-13 09:19:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:28,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:28,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:28,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:28,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:19:28,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:28,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:28,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:19:28,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:28,440 INFO L130 PetriNetUnfolder]: 64/186 cut-off events. [2022-12-13 09:19:28,440 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 09:19:28,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 186 events. 64/186 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 787 event pairs, 10 based on Foata normal form. 30/172 useless extension candidates. Maximal degree in co-relation 562. Up to 94 conditions per place. [2022-12-13 09:19:28,441 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 18 selfloop transitions, 13 changer transitions 13/47 dead transitions. [2022-12-13 09:19:28,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 269 flow [2022-12-13 09:19:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-12-13 09:19:28,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-13 09:19:28,446 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 115 flow. Second operand 6 states and 69 transitions. [2022-12-13 09:19:28,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 269 flow [2022-12-13 09:19:28,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 230 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:28,452 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:28,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-13 09:19:28,454 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-12-13 09:19:28,454 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:28,454 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:28,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:28,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:28,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 132 flow [2022-12-13 09:19:28,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 132 flow [2022-12-13 09:19:28,467 INFO L130 PetriNetUnfolder]: 9/63 cut-off events. [2022-12-13 09:19:28,467 INFO L131 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2022-12-13 09:19:28,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 63 events. 9/63 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 226 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2022-12-13 09:19:28,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 132 flow [2022-12-13 09:19:28,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-13 09:19:28,970 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:19:28,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 517 [2022-12-13 09:19:28,971 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 128 flow [2022-12-13 09:19:28,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:28,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:28,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:28,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:19:28,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1793937215, now seen corresponding path program 1 times [2022-12-13 09:19:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808323480] [2022-12-13 09:19:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:29,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808323480] [2022-12-13 09:19:29,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808323480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:29,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:29,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422998934] [2022-12-13 09:19:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:29,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:29,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2022-12-13 09:19:29,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:29,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:29,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2022-12-13 09:19:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:29,201 INFO L130 PetriNetUnfolder]: 50/143 cut-off events. [2022-12-13 09:19:29,201 INFO L131 PetriNetUnfolder]: For 258/264 co-relation queries the response was YES. [2022-12-13 09:19:29,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 143 events. 50/143 cut-off events. For 258/264 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 610 event pairs, 0 based on Foata normal form. 15/132 useless extension candidates. Maximal degree in co-relation 497. Up to 84 conditions per place. [2022-12-13 09:19:29,202 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 21 selfloop transitions, 1 changer transitions 16/43 dead transitions. [2022-12-13 09:19:29,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 290 flow [2022-12-13 09:19:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:19:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:19:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 09:19:29,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-13 09:19:29,204 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 128 flow. Second operand 4 states and 46 transitions. [2022-12-13 09:19:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 290 flow [2022-12-13 09:19:29,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 240 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 09:19:29,207 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 101 flow [2022-12-13 09:19:29,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-12-13 09:19:29,208 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -18 predicate places. [2022-12-13 09:19:29,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:29,208 INFO L89 Accepts]: Start accepts. Operand has 33 places, 24 transitions, 101 flow [2022-12-13 09:19:29,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:29,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:29,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 101 flow [2022-12-13 09:19:29,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 101 flow [2022-12-13 09:19:29,216 INFO L130 PetriNetUnfolder]: 9/49 cut-off events. [2022-12-13 09:19:29,216 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 09:19:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 49 events. 9/49 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 165 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 115. Up to 28 conditions per place. [2022-12-13 09:19:29,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 101 flow [2022-12-13 09:19:29,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 09:19:29,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:19:29,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-13 09:19:29,628 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 99 flow [2022-12-13 09:19:29,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:29,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:29,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:19:29,629 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1464235778, now seen corresponding path program 1 times [2022-12-13 09:19:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:29,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116983290] [2022-12-13 09:19:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:30,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116983290] [2022-12-13 09:19:30,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116983290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:30,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:30,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:19:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589441384] [2022-12-13 09:19:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:30,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:19:30,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:19:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:19:30,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2022-12-13 09:19:30,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:30,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:30,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2022-12-13 09:19:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:30,961 INFO L130 PetriNetUnfolder]: 36/113 cut-off events. [2022-12-13 09:19:30,961 INFO L131 PetriNetUnfolder]: For 137/145 co-relation queries the response was YES. [2022-12-13 09:19:30,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 113 events. 36/113 cut-off events. For 137/145 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 429 event pairs, 2 based on Foata normal form. 17/106 useless extension candidates. Maximal degree in co-relation 345. Up to 46 conditions per place. [2022-12-13 09:19:30,962 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 13 selfloop transitions, 4 changer transitions 23/46 dead transitions. [2022-12-13 09:19:30,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 284 flow [2022-12-13 09:19:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 09:19:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 09:19:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-12-13 09:19:30,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 09:19:30,963 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 99 flow. Second operand 9 states and 69 transitions. [2022-12-13 09:19:30,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 284 flow [2022-12-13 09:19:30,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 278 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:30,965 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 110 flow [2022-12-13 09:19:30,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-13 09:19:30,966 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-12-13 09:19:30,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:30,966 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 110 flow [2022-12-13 09:19:30,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:30,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:30,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 110 flow [2022-12-13 09:19:30,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 110 flow [2022-12-13 09:19:30,974 INFO L130 PetriNetUnfolder]: 9/47 cut-off events. [2022-12-13 09:19:30,974 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 09:19:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 47 events. 9/47 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 124 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 120. Up to 28 conditions per place. [2022-12-13 09:19:30,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 110 flow [2022-12-13 09:19:30,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 09:19:33,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L797: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_495 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_157 256) 0)))) (and (= v_~x$r_buff1_thd2~0_238 (ite .cse0 v_~x$r_buff0_thd2~0_281 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_280 256) 0))) (or (and (= (mod v_~x$r_buff0_thd2~0_281 256) 0) .cse1) .cse2 (and .cse1 (= (mod v_~x$w_buff1_used~0_459 256) 0)))) v_~x$r_buff0_thd2~0_281 0))) (= v_~x$w_buff0~0_331 v_~x$w_buff1~0_306) (= v_~x$r_buff0_thd1~0_188 v_~x$r_buff1_thd1~0_190) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~x$mem_tmp~0_139 v_~__unbuffered_p1_EAX~0_117) v_~x~0_420) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_64| v_~weak$$choice0~0_115) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd2~0_280 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_172) (= v_~x$w_buff0~0_330 1) (= (ite (= (mod v_~x$w_buff0_used~0_496 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff1_used~0_459 (ite .cse0 v_~x$w_buff0_used~0_496 (ite .cse2 v_~x$w_buff0_used~0_496 0))) (= v_~x$flush_delayed~0_149 0) (= v_~x~0_421 v_~x$mem_tmp~0_139) (= v_~__unbuffered_p1_EAX~0_117 1) (= v_~weak$$choice2~0_157 |v_P1Thread1of1ForFork0_#t~nondet6#1_64|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~__unbuffered_p1_EBX~0_92 v_~y~0_64) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_495))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_64|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_64|, ~y~0=v_~y~0_64, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_281, ~x~0=v_~x~0_421, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_149, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_190, ~x$mem_tmp~0=v_~x$mem_tmp~0_139, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, ~y~0=v_~y~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_238, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_280, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~x~0=v_~x~0_420} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [448] $Ultimate##0-->P0EXIT: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_197 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_195 256) 0))) (let ((.cse7 (not .cse5)) (.cse12 (= (mod v_~x$w_buff0_used~0_504 256) 0)) (.cse11 (and (= (mod v_~x$w_buff1_used~0_466 256) 0) .cse5)) (.cse3 (and .cse10 .cse5))) (let ((.cse1 (or .cse12 .cse11 .cse3)) (.cse2 (and (not .cse12) .cse7))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_465 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_503 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_161 256) 0))) (.cse8 (ite .cse1 v_~x~0_429 (ite .cse2 v_~x$w_buff0~0_339 v_~x$w_buff1~0_313)))) (and (= (ite .cse0 v_~x$w_buff0_used~0_504 (ite .cse1 v_~x$w_buff0_used~0_504 (ite .cse2 0 v_~x$w_buff0_used~0_504))) v_~x$w_buff0_used~0_503) (= (ite .cse0 v_~x$r_buff0_thd1~0_195 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_195 (ite (and (not .cse6) .cse7) 0 v_~x$r_buff0_thd1~0_195))) v_~x$r_buff0_thd1~0_194) (= v_~x$w_buff1~0_313 v_~x$w_buff1~0_312) (= .cse8 v_~__unbuffered_p0_EAX~0_139) (= v_~weak$$choice2~0_161 |v_P0Thread1of1ForFork1_#t~nondet4_116|) (= v_~x$r_buff1_thd1~0_196 (ite .cse0 v_~x$r_buff1_thd1~0_197 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_194 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse4) .cse6)) v_~x$r_buff1_thd1~0_197 0))) (= |v_P0Thread1of1ForFork1_#res.base_51| 0) (= v_~x$flush_delayed~0_153 0) (= v_~x$w_buff1_used~0_465 (ite .cse0 v_~x$w_buff1_used~0_466 (ite (or .cse11 .cse3 .cse6) v_~x$w_buff1_used~0_466 0))) (= v_~x$w_buff0~0_339 v_~x$w_buff0~0_338) (= |v_P0Thread1of1ForFork1_#res.offset_51| 0) (= v_~weak$$choice0~0_119 |v_P0Thread1of1ForFork1_#t~nondet3_115|) (= v_~x~0_429 v_~x$mem_tmp~0_143) (= v_~__unbuffered_cnt~0_347 (+ v_~__unbuffered_cnt~0_348 1)) (= (ite .cse0 v_~x$mem_tmp~0_143 .cse8) v_~x~0_428) (= v_~y~0_68 1) (= v_P0Thread1of1ForFork1_~arg.offset_31 |v_P0Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork1_#in~arg.base_31| v_P0Thread1of1ForFork1_~arg.base_31)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_339, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_313, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_466, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_348, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_115|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x~0=v_~x~0_429, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_116|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_504} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_338, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_51|, ~x$flush_delayed~0=v_~x$flush_delayed~0_153, ~x$w_buff1~0=v_~x$w_buff1~0_312, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_51|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_465, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_196, ~x$mem_tmp~0=v_~x$mem_tmp~0_143, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_503, ~weak$$choice0~0=v_~weak$$choice0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_31, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_347, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y~0=v_~y~0_68, ~x~0=v_~x~0_428} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#res.offset, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork1_#res.base, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 09:19:33,549 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L797: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_495 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_157 256) 0)))) (and (= v_~x$r_buff1_thd2~0_238 (ite .cse0 v_~x$r_buff0_thd2~0_281 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_280 256) 0))) (or (and (= (mod v_~x$r_buff0_thd2~0_281 256) 0) .cse1) .cse2 (and .cse1 (= (mod v_~x$w_buff1_used~0_459 256) 0)))) v_~x$r_buff0_thd2~0_281 0))) (= v_~x$w_buff0~0_331 v_~x$w_buff1~0_306) (= v_~x$r_buff0_thd1~0_188 v_~x$r_buff1_thd1~0_190) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~x$mem_tmp~0_139 v_~__unbuffered_p1_EAX~0_117) v_~x~0_420) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_64| v_~weak$$choice0~0_115) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd2~0_280 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_172) (= v_~x$w_buff0~0_330 1) (= (ite (= (mod v_~x$w_buff0_used~0_496 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff1_used~0_459 (ite .cse0 v_~x$w_buff0_used~0_496 (ite .cse2 v_~x$w_buff0_used~0_496 0))) (= v_~x$flush_delayed~0_149 0) (= v_~x~0_421 v_~x$mem_tmp~0_139) (= v_~__unbuffered_p1_EAX~0_117 1) (= v_~weak$$choice2~0_157 |v_P1Thread1of1ForFork0_#t~nondet6#1_64|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~__unbuffered_p1_EBX~0_92 v_~y~0_64) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_495))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_64|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_64|, ~y~0=v_~y~0_64, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_281, ~x~0=v_~x~0_421, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_149, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_190, ~x$mem_tmp~0=v_~x$mem_tmp~0_139, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, ~y~0=v_~y~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_238, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_280, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~x~0=v_~x~0_420} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [449] $Ultimate##0-->P0FINAL: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_201 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_199 256) 0))) (let ((.cse10 (not .cse9)) (.cse12 (= (mod v_~x$w_buff0_used~0_508 256) 0)) (.cse3 (and .cse9 .cse7)) (.cse5 (and .cse9 (= (mod v_~x$w_buff1_used~0_470 256) 0)))) (let ((.cse1 (or .cse12 .cse3 .cse5)) (.cse2 (and .cse10 (not .cse12)))) (let ((.cse8 (= (mod v_~x$w_buff1_used~0_469 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_507 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_163 256) 0))) (.cse11 (ite .cse1 v_~x~0_433 (ite .cse2 v_~x$w_buff0~0_343 v_~x$w_buff1~0_317)))) (and (= |v_P0Thread1of1ForFork1_#in~arg.base_33| v_P0Thread1of1ForFork1_~arg.base_33) (= v_~x~0_433 v_~x$mem_tmp~0_145) (= |v_P0Thread1of1ForFork1_#res.base_53| 0) (= v_~x$w_buff0_used~0_507 (ite .cse0 v_~x$w_buff0_used~0_508 (ite .cse1 v_~x$w_buff0_used~0_508 (ite .cse2 0 v_~x$w_buff0_used~0_508)))) (= v_P0Thread1of1ForFork1_~arg.offset_33 |v_P0Thread1of1ForFork1_#in~arg.offset_33|) (= |v_P0Thread1of1ForFork1_#res.offset_53| 0) (= v_~weak$$choice2~0_163 |v_P0Thread1of1ForFork1_#t~nondet4_120|) (= v_~x$flush_delayed~0_155 0) (= v_~x$w_buff1_used~0_469 (ite .cse0 v_~x$w_buff1_used~0_470 (ite (or .cse3 .cse4 .cse5) v_~x$w_buff1_used~0_470 0))) (= v_~x$r_buff1_thd1~0_200 (ite .cse0 v_~x$r_buff1_thd1~0_201 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd1~0_198 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse6))) v_~x$r_buff1_thd1~0_201 0))) (= v_~weak$$choice0~0_121 |v_P0Thread1of1ForFork1_#t~nondet3_119|) (= v_~x$w_buff1~0_317 v_~x$w_buff1~0_316) (= v_~x$w_buff0~0_343 v_~x$w_buff0~0_342) (= v_~x$r_buff0_thd1~0_198 (ite .cse0 v_~x$r_buff0_thd1~0_199 (ite (or .cse3 .cse4 (and .cse8 .cse9)) v_~x$r_buff0_thd1~0_199 (ite (and .cse10 (not .cse4)) 0 v_~x$r_buff0_thd1~0_199)))) (= (+ v_~__unbuffered_cnt~0_352 1) v_~__unbuffered_cnt~0_351) (= .cse11 v_~__unbuffered_p0_EAX~0_141) (= (ite .cse0 v_~x$mem_tmp~0_145 .cse11) v_~x~0_432) (= v_~y~0_70 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_343, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_199, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_470, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_352, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_201, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_119|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x~0=v_~x~0_433, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_120|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_342, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_53|, ~x$flush_delayed~0=v_~x$flush_delayed~0_155, ~x$w_buff1~0=v_~x$w_buff1~0_316, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_53|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_469, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_200, ~x$mem_tmp~0=v_~x$mem_tmp~0_145, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_141, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_351, ~weak$$choice2~0=v_~weak$$choice2~0_163, ~y~0=v_~y~0_70, ~x~0=v_~x~0_432} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#res.offset, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork1_#res.base, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 09:19:34,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L797: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_495 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_157 256) 0)))) (and (= v_~x$r_buff1_thd2~0_238 (ite .cse0 v_~x$r_buff0_thd2~0_281 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_280 256) 0))) (or (and (= (mod v_~x$r_buff0_thd2~0_281 256) 0) .cse1) .cse2 (and .cse1 (= (mod v_~x$w_buff1_used~0_459 256) 0)))) v_~x$r_buff0_thd2~0_281 0))) (= v_~x$w_buff0~0_331 v_~x$w_buff1~0_306) (= v_~x$r_buff0_thd1~0_188 v_~x$r_buff1_thd1~0_190) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~x$mem_tmp~0_139 v_~__unbuffered_p1_EAX~0_117) v_~x~0_420) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_64| v_~weak$$choice0~0_115) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd2~0_280 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_172) (= v_~x$w_buff0~0_330 1) (= (ite (= (mod v_~x$w_buff0_used~0_496 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff1_used~0_459 (ite .cse0 v_~x$w_buff0_used~0_496 (ite .cse2 v_~x$w_buff0_used~0_496 0))) (= v_~x$flush_delayed~0_149 0) (= v_~x~0_421 v_~x$mem_tmp~0_139) (= v_~__unbuffered_p1_EAX~0_117 1) (= v_~weak$$choice2~0_157 |v_P1Thread1of1ForFork0_#t~nondet6#1_64|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~__unbuffered_p1_EBX~0_92 v_~y~0_64) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_495))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_64|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_64|, ~y~0=v_~y~0_64, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_281, ~x~0=v_~x~0_421, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_149, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_190, ~x$mem_tmp~0=v_~x$mem_tmp~0_139, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, ~y~0=v_~y~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_238, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_280, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~x~0=v_~x~0_420} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [438] $Ultimate##0-->L758: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_159 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_159 256) 0))) (let ((.cse5 (not .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_426 256) 0)) (.cse11 (and (= (mod v_~x$w_buff1_used~0_394 256) 0) .cse4)) (.cse1 (and .cse7 .cse4))) (let ((.cse9 (or .cse12 .cse11 .cse1)) (.cse10 (and (not .cse12) .cse5))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_393 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_137 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_425 256) 0)) (.cse8 (ite .cse9 v_~x~0_357 (ite .cse10 v_~x$w_buff0~0_277 v_~x$w_buff1~0_257)))) (and (= v_~x~0_357 v_~x$mem_tmp~0_119) (= (ite .cse0 v_~x$r_buff0_thd1~0_159 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~x$r_buff0_thd1~0_159 (ite (and (not .cse2) .cse5) 0 v_~x$r_buff0_thd1~0_159))) v_~x$r_buff0_thd1~0_158) (= (ite .cse0 v_~x$r_buff1_thd1~0_159 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd1~0_158 256) 0))) (or .cse2 (and .cse6 .cse3) (and .cse6 .cse7))) v_~x$r_buff1_thd1~0_159 0)) v_~x$r_buff1_thd1~0_158) (= v_~weak$$choice2~0_137 |v_P0Thread1of1ForFork1_#t~nondet4_84|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= (ite .cse0 v_~x$mem_tmp~0_119 .cse8) v_~x~0_356) (= v_~x$w_buff0_used~0_425 (ite .cse0 v_~x$w_buff0_used~0_426 (ite .cse9 v_~x$w_buff0_used~0_426 (ite .cse10 0 v_~x$w_buff0_used~0_426)))) (= v_~x$flush_delayed~0_129 0) (= v_~x$w_buff1_used~0_393 (ite .cse0 v_~x$w_buff1_used~0_394 (ite (or .cse11 .cse1 .cse2) v_~x$w_buff1_used~0_394 0))) (= v_~y~0_50 1) (= v_~x$w_buff0~0_277 v_~x$w_buff0~0_276) (= .cse8 v_~__unbuffered_p0_EAX~0_123) (= v_~x$w_buff1~0_257 v_~x$w_buff1~0_256) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= |v_P0Thread1of1ForFork1_#t~nondet3_83| v_~weak$$choice0~0_95)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_277, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_159, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_257, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_394, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_159, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_83|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_357, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_84|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_426} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_276, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_158, ~x$flush_delayed~0=v_~x$flush_delayed~0_129, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_393, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_158, ~x$mem_tmp~0=v_~x$mem_tmp~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_425, ~weak$$choice0~0=v_~weak$$choice0~0_95, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_123, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~y~0=v_~y~0_50, ~x~0=v_~x~0_356} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 09:19:34,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] $Ultimate##0-->L797: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_495 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_157 256) 0)))) (and (= v_~x$r_buff1_thd2~0_238 (ite .cse0 v_~x$r_buff0_thd2~0_281 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_280 256) 0))) (or (and (= (mod v_~x$r_buff0_thd2~0_281 256) 0) .cse1) .cse2 (and .cse1 (= (mod v_~x$w_buff1_used~0_459 256) 0)))) v_~x$r_buff0_thd2~0_281 0))) (= v_~x$w_buff0~0_331 v_~x$w_buff1~0_306) (= v_~x$r_buff0_thd1~0_188 v_~x$r_buff1_thd1~0_190) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= (ite .cse0 v_~x$mem_tmp~0_139 v_~__unbuffered_p1_EAX~0_117) v_~x~0_420) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_64| v_~weak$$choice0~0_115) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd2~0_280 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_172) (= v_~x$w_buff0~0_330 1) (= (ite (= (mod v_~x$w_buff0_used~0_496 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~x$w_buff1_used~0_459 (ite .cse0 v_~x$w_buff0_used~0_496 (ite .cse2 v_~x$w_buff0_used~0_496 0))) (= v_~x$flush_delayed~0_149 0) (= v_~x~0_421 v_~x$mem_tmp~0_139) (= v_~__unbuffered_p1_EAX~0_117 1) (= v_~weak$$choice2~0_157 |v_P1Thread1of1ForFork0_#t~nondet6#1_64|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~__unbuffered_p1_EBX~0_92 v_~y~0_64) (= (ite .cse0 1 0) v_~x$w_buff0_used~0_495))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_64|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_64|, ~y~0=v_~y~0_64, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_281, ~x~0=v_~x~0_421, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_330, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_188, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_149, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_190, ~x$mem_tmp~0=v_~x$mem_tmp~0_139, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, ~y~0=v_~y~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_238, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_459, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_280, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~x~0=v_~x~0_420} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [447] $Ultimate##0-->L763: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd1~0_193 256) 0)) (.cse7 (= (mod v_~x$r_buff0_thd1~0_191 256) 0))) (let ((.cse8 (not .cse7)) (.cse12 (= 0 (mod v_~x$w_buff0_used~0_500 256))) (.cse5 (and .cse7 .cse2)) (.cse6 (and .cse7 (= (mod v_~x$w_buff1_used~0_462 256) 0)))) (let ((.cse10 (or .cse12 .cse5 .cse6)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_461 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_499 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_159 256) 0))) (.cse9 (ite .cse10 v_~x~0_425 (ite .cse11 v_~x$w_buff0~0_335 v_~x$w_buff1~0_309)))) (and (= v_~x$w_buff1~0_309 v_~x$w_buff1~0_308) (= v_~x$r_buff1_thd1~0_192 (ite .cse0 v_~x$r_buff1_thd1~0_193 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd1~0_190 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~x$r_buff1_thd1~0_193 0))) (= v_~weak$$choice0~0_117 |v_P0Thread1of1ForFork1_#t~nondet3_111|) (= (ite .cse0 v_~x$w_buff1_used~0_462 (ite (or .cse5 .cse6 .cse4) v_~x$w_buff1_used~0_462 0)) v_~x$w_buff1_used~0_461) (= v_~y~0_66 1) (= v_~__unbuffered_cnt~0_343 (+ v_~__unbuffered_cnt~0_344 1)) (= v_~x$w_buff0~0_335 v_~x$w_buff0~0_334) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= (ite .cse0 v_~x$r_buff0_thd1~0_191 (ite (or (and .cse7 .cse3) .cse5 .cse4) v_~x$r_buff0_thd1~0_191 (ite (and (not .cse4) .cse8) 0 v_~x$r_buff0_thd1~0_191))) v_~x$r_buff0_thd1~0_190) (= v_~x$flush_delayed~0_151 0) (= (ite .cse0 v_~x$mem_tmp~0_141 .cse9) v_~x~0_424) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= (ite .cse0 v_~x$w_buff0_used~0_500 (ite .cse10 v_~x$w_buff0_used~0_500 (ite .cse11 0 v_~x$w_buff0_used~0_500))) v_~x$w_buff0_used~0_499) (= v_~weak$$choice2~0_159 |v_P0Thread1of1ForFork1_#t~nondet4_112|) (= v_~x~0_425 v_~x$mem_tmp~0_141) (= .cse9 v_~__unbuffered_p0_EAX~0_137)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_191, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_309, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_462, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_344, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_193, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_111|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x~0=v_~x~0_425, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_112|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_500} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_334, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_190, ~x$flush_delayed~0=v_~x$flush_delayed~0_151, ~x$w_buff1~0=v_~x$w_buff1~0_308, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_461, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, ~x$mem_tmp~0=v_~x$mem_tmp~0_141, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_499, ~weak$$choice0~0=v_~weak$$choice0~0_117, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_343, ~weak$$choice2~0=v_~weak$$choice2~0_159, ~y~0=v_~y~0_66, ~x~0=v_~x~0_424} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 09:19:34,844 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:19:34,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3879 [2022-12-13 09:19:34,845 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 132 flow [2022-12-13 09:19:34,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:34,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:34,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:34,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:19:34,845 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:19:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -972055659, now seen corresponding path program 1 times [2022-12-13 09:19:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678572879] [2022-12-13 09:19:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:19:34,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:19:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:19:34,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:19:34,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:19:34,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:19:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:19:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:19:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:19:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:19:34,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:19:34,920 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:34,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:19:34,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:19:34,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:19:34 BasicIcfg [2022-12-13 09:19:34,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:19:34,978 INFO L158 Benchmark]: Toolchain (without parser) took 14230.21ms. Allocated memory was 209.7MB in the beginning and 342.9MB in the end (delta: 133.2MB). Free memory was 176.1MB in the beginning and 146.6MB in the end (delta: 29.5MB). Peak memory consumption was 163.7MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,978 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:19:34,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 209.7MB. Free memory was 175.6MB in the beginning and 149.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.36ms. Allocated memory is still 209.7MB. Free memory was 149.9MB in the beginning and 147.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,979 INFO L158 Benchmark]: Boogie Preprocessor took 51.96ms. Allocated memory is still 209.7MB. Free memory was 147.3MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,979 INFO L158 Benchmark]: RCFGBuilder took 717.66ms. Allocated memory is still 209.7MB. Free memory was 145.2MB in the beginning and 110.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,980 INFO L158 Benchmark]: TraceAbstraction took 12855.02ms. Allocated memory was 209.7MB in the beginning and 342.9MB in the end (delta: 133.2MB). Free memory was 109.0MB in the beginning and 146.6MB in the end (delta: -37.7MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2022-12-13 09:19:34,981 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.13ms. Allocated memory is still 209.7MB. Free memory is still 187.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 209.7MB. Free memory was 175.6MB in the beginning and 149.9MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.36ms. Allocated memory is still 209.7MB. Free memory was 149.9MB in the beginning and 147.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.96ms. Allocated memory is still 209.7MB. Free memory was 147.3MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 717.66ms. Allocated memory is still 209.7MB. Free memory was 145.2MB in the beginning and 110.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12855.02ms. Allocated memory was 209.7MB in the beginning and 342.9MB in the end (delta: 133.2MB). Free memory was 109.0MB in the beginning and 146.6MB in the end (delta: -37.7MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 92 PlacesBefore, 51 PlacesAfterwards, 87 TransitionsBefore, 45 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 4 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1719, independent: 1626, independent conditional: 1626, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1076, independent: 1043, independent conditional: 0, independent unconditional: 1043, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, independent: 1043, independent conditional: 0, independent unconditional: 1043, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, independent: 1025, independent conditional: 0, independent unconditional: 1025, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 307, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1719, independent: 583, independent conditional: 583, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 1076, unknown conditional: 1076, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1047, Positive conditional cache size: 1047, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 67, independent conditional: 5, independent unconditional: 62, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, independent: 67, independent conditional: 5, independent unconditional: 62, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 87, dependent conditional: 7, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 67, Positive conditional cache size: 67, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 2, independent unconditional: 39, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 69, dependent conditional: 17, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 108, Positive conditional cache size: 108, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 115, Positive conditional cache size: 115, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 35 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 31 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 32, independent conditional: 20, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 32, independent conditional: 20, independent unconditional: 12, 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: 38, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 129, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 157, Positive conditional cache size: 157, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 34 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 19 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 33, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 165, Positive conditional cache size: 165, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [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))=-2, 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))=-1, 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 [L796] 2 __unbuffered_p1_EBX = y [L741] 2 y = 1 [L744] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L745] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L746] 2 x$flush_delayed = weak$$choice2 [L747] 2 x$mem_tmp = x [L748] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 2 __unbuffered_p0_EAX = x [L756] 2 x = x$flush_delayed ? x$mem_tmp : x [L757] 2 x$flush_delayed = (_Bool)0 [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1] [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 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L828] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L828] RET 0 assume_abort_if_not(main$tmp_guard0) [L830] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L837] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L839] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 12.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 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-13 09:19:35,010 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...