/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:13:40,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:13:40,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:13:40,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:13:40,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:13:40,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:13:40,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:13:40,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:13:40,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:13:40,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:13:40,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:13:40,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:13:40,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:13:40,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:13:40,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:13:40,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:13:40,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:13:40,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:13:40,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:13:40,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:13:40,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:13:40,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:13:40,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:13:40,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:13:40,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:13:40,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:13:40,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:13:40,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:13:40,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:13:40,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:13:40,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:13:40,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:13:40,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:13:40,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:13:40,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:13:40,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:13:40,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:13:40,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:13:40,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:13:40,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:13:40,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:13:40,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:13:40,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:13:40,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:13:40,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:13:40,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:13:40,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:13:40,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:13:40,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:13:40,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:13:40,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:13:40,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:13:40,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:13:40,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:13:40,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:13:41,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:13:41,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:13:41,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:13:41,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:13:41,087 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:13:41,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-06 01:13:42,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:13:42,406 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:13:42,407 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-06 01:13:42,427 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9092c06bc/f27a338c26064df3b61e0723a0750e86/FLAGd3e26a6e7 [2022-12-06 01:13:42,442 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9092c06bc/f27a338c26064df3b61e0723a0750e86 [2022-12-06 01:13:42,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:13:42,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:13:42,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:13:42,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:13:42,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:13:42,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:42,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52844a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42, skipping insertion in model container [2022-12-06 01:13:42,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:42,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:13:42,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:13:42,640 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/safe015_power.opt.i[994,1007] [2022-12-06 01:13:42,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:13:42,842 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:13:42,859 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/safe015_power.opt.i[994,1007] [2022-12-06 01:13:42,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:13:42,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:13:42,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:13:42,937 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:13:42,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42 WrapperNode [2022-12-06 01:13:42,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:13:42,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:13:42,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:13:42,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:13:42,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:42,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:42,975 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-12-06 01:13:42,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:13:42,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:13:42,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:13:42,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:13:42,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:42,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,026 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:13:43,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:13:43,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:13:43,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:13:43,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (1/1) ... [2022-12-06 01:13:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:13:43,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:13:43,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:13:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:13:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:13:43,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:13:43,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:13:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:13:43,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:13:43,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:13:43,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:13:43,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:13:43,118 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:13:43,232 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:13:43,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:13:43,673 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:13:43,936 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:13:43,937 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:13:43,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:13:43 BoogieIcfgContainer [2022-12-06 01:13:43,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:13:43,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:13:43,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:13:43,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:13:43,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:13:42" (1/3) ... [2022-12-06 01:13:43,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa7d8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:13:43, skipping insertion in model container [2022-12-06 01:13:43,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:13:42" (2/3) ... [2022-12-06 01:13:43,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa7d8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:13:43, skipping insertion in model container [2022-12-06 01:13:43,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:13:43" (3/3) ... [2022-12-06 01:13:43,944 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-12-06 01:13:43,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:13:43,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:13:43,957 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:13:44,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:13:44,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 01:13:44,085 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 01:13:44,085 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:44,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 01:13:44,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 01:13:44,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 01:13:44,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:44,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 01:13:44,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 01:13:44,138 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 01:13:44,138 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:44,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-06 01:13:44,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 01:13:44,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-06 01:13:53,537 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 01:13:53,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:13:53,562 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;@64071ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:13:53,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:13:53,567 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 01:13:53,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:13:53,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:53,568 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:53,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:13:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -384375228, now seen corresponding path program 1 times [2022-12-06 01:13:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:53,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196356013] [2022-12-06 01:13:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:13:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:53,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196356013] [2022-12-06 01:13:53,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196356013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:53,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:53,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152987319] [2022-12-06 01:13:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:53,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 01:13:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:53,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 01:13:53,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 01:13:53,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 01:13:53,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:53,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:53,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 01:13:53,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:54,045 INFO L130 PetriNetUnfolder]: 567/884 cut-off events. [2022-12-06 01:13:54,045 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 01:13:54,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 884 events. 567/884 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3659 event pairs, 567 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 1784. Up to 865 conditions per place. [2022-12-06 01:13:54,054 INFO L137 encePairwiseOnDemand]: 20/21 looper letters, 18 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2022-12-06 01:13:54,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 85 flow [2022-12-06 01:13:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 01:13:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 01:13:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-12-06 01:13:54,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 01:13:54,064 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 01:13:54,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:54,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 85 flow [2022-12-06 01:13:54,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 85 flow [2022-12-06 01:13:54,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 01:13:54,786 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:13:54,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 724 [2022-12-06 01:13:54,788 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 81 flow [2022-12-06 01:13:54,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:54,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:54,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:54,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:13:54,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:13:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash -17396267, now seen corresponding path program 1 times [2022-12-06 01:13:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761168382] [2022-12-06 01:13:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:13:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:55,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761168382] [2022-12-06 01:13:55,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761168382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:55,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247409669] [2022-12-06 01:13:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:55,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:13:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:13:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:13:55,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 01:13:55,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 81 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:55,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:55,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 01:13:55,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:55,323 INFO L130 PetriNetUnfolder]: 545/834 cut-off events. [2022-12-06 01:13:55,323 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 01:13:55,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 834 events. 545/834 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3242 event pairs, 137 based on Foata normal form. 8/842 useless extension candidates. Maximal degree in co-relation 2536. Up to 835 conditions per place. [2022-12-06 01:13:55,328 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2022-12-06 01:13:55,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 195 flow [2022-12-06 01:13:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:13:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:13:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 01:13:55,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-06 01:13:55,331 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2022-12-06 01:13:55,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:55,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 30 transitions, 195 flow [2022-12-06 01:13:55,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 30 transitions, 195 flow [2022-12-06 01:13:55,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:59,059 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 01:13:59,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3729 [2022-12-06 01:13:59,060 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 195 flow [2022-12-06 01:13:59,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:59,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:13:59,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:13:59,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:13:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:13:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -539285889, now seen corresponding path program 1 times [2022-12-06 01:13:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:13:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405493716] [2022-12-06 01:13:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:13:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:13:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:13:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:13:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:13:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405493716] [2022-12-06 01:13:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405493716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:13:59,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:13:59,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:13:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280246957] [2022-12-06 01:13:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:13:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:13:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:13:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:13:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:13:59,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:13:59,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 195 flow. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:59,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:13:59,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:13:59,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:13:59,474 INFO L130 PetriNetUnfolder]: 504/781 cut-off events. [2022-12-06 01:13:59,475 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 01:13:59,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 781 events. 504/781 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3004 event pairs, 72 based on Foata normal form. 24/805 useless extension candidates. Maximal degree in co-relation 3156. Up to 782 conditions per place. [2022-12-06 01:13:59,484 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 01:13:59,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 351 flow [2022-12-06 01:13:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:13:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:13:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 01:13:59,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:13:59,488 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 01:13:59,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:13:59,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 42 transitions, 351 flow [2022-12-06 01:13:59,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 42 transitions, 351 flow [2022-12-06 01:13:59,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:02,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:02,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3338 [2022-12-06 01:14:02,826 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 42 transitions, 353 flow [2022-12-06 01:14:02,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:02,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:02,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:02,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:14:02,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 462005261, now seen corresponding path program 1 times [2022-12-06 01:14:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:02,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2358954] [2022-12-06 01:14:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:04,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:04,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2358954] [2022-12-06 01:14:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2358954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:14:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623783598] [2022-12-06 01:14:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:04,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:14:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:14:04,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:14:04,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:14:04,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 42 transitions, 353 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:04,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:04,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:14:04,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:04,516 INFO L130 PetriNetUnfolder]: 463/729 cut-off events. [2022-12-06 01:14:04,516 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 01:14:04,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 729 events. 463/729 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2758 event pairs, 51 based on Foata normal form. 22/751 useless extension candidates. Maximal degree in co-relation 3675. Up to 730 conditions per place. [2022-12-06 01:14:04,521 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 57 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2022-12-06 01:14:04,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 62 transitions, 641 flow [2022-12-06 01:14:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 01:14:04,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 01:14:04,524 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 01:14:04,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:04,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 62 transitions, 641 flow [2022-12-06 01:14:04,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 62 transitions, 641 flow [2022-12-06 01:14:04,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:07,792 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:07,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3269 [2022-12-06 01:14:07,793 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 62 transitions, 645 flow [2022-12-06 01:14:07,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:07,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:07,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:07,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:14:07,793 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1437295396, now seen corresponding path program 1 times [2022-12-06 01:14:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:07,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175267372] [2022-12-06 01:14:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:07,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:08,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:08,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175267372] [2022-12-06 01:14:08,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175267372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:08,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:08,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:14:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600468284] [2022-12-06 01:14:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:14:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:14:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:14:08,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 01:14:08,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 62 transitions, 645 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:08,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:08,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 01:14:08,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:09,011 INFO L130 PetriNetUnfolder]: 600/948 cut-off events. [2022-12-06 01:14:09,011 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 01:14:09,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5751 conditions, 948 events. 600/948 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3946 event pairs, 55 based on Foata normal form. 44/992 useless extension candidates. Maximal degree in co-relation 5728. Up to 949 conditions per place. [2022-12-06 01:14:09,023 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 81 selfloop transitions, 24 changer transitions 0/105 dead transitions. [2022-12-06 01:14:09,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 105 transitions, 1290 flow [2022-12-06 01:14:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 01:14:09,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-06 01:14:09,028 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-06 01:14:09,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:09,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 105 transitions, 1290 flow [2022-12-06 01:14:09,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 105 transitions, 1290 flow [2022-12-06 01:14:09,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:09,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:09,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 01:14:09,046 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 105 transitions, 1290 flow [2022-12-06 01:14:09,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:09,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:09,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:09,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:14:09,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:09,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1271381683, now seen corresponding path program 1 times [2022-12-06 01:14:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:09,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843920460] [2022-12-06 01:14:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:09,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843920460] [2022-12-06 01:14:09,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843920460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:09,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:09,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:14:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438805142] [2022-12-06 01:14:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:09,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:14:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:14:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:14:09,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:14:09,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 105 transitions, 1290 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:09,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:09,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:14:09,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:09,995 INFO L130 PetriNetUnfolder]: 619/982 cut-off events. [2022-12-06 01:14:09,995 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 01:14:09,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6938 conditions, 982 events. 619/982 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4105 event pairs, 54 based on Foata normal form. 3/985 useless extension candidates. Maximal degree in co-relation 6912. Up to 983 conditions per place. [2022-12-06 01:14:10,002 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 102 selfloop transitions, 29 changer transitions 0/131 dead transitions. [2022-12-06 01:14:10,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 131 transitions, 1870 flow [2022-12-06 01:14:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 01:14:10,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-06 01:14:10,006 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2022-12-06 01:14:10,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:10,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 131 transitions, 1870 flow [2022-12-06 01:14:10,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 131 transitions, 1870 flow [2022-12-06 01:14:10,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:10,014 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:10,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:14:10,015 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 131 transitions, 1870 flow [2022-12-06 01:14:10,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:10,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:10,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:10,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:14:10,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1269173044, now seen corresponding path program 1 times [2022-12-06 01:14:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:10,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187633786] [2022-12-06 01:14:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:10,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:10,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187633786] [2022-12-06 01:14:10,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187633786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:10,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:10,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:14:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865005580] [2022-12-06 01:14:10,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:10,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:14:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:10,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:14:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:14:10,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:14:10,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 131 transitions, 1870 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:10,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:10,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:14:10,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:10,372 INFO L130 PetriNetUnfolder]: 689/1132 cut-off events. [2022-12-06 01:14:10,372 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 01:14:10,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9121 conditions, 1132 events. 689/1132 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5205 event pairs, 6 based on Foata normal form. 40/1172 useless extension candidates. Maximal degree in co-relation 9092. Up to 1133 conditions per place. [2022-12-06 01:14:10,379 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 130 selfloop transitions, 10 changer transitions 15/155 dead transitions. [2022-12-06 01:14:10,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 155 transitions, 2516 flow [2022-12-06 01:14:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:14:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:14:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 01:14:10,380 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 01:14:10,380 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2022-12-06 01:14:10,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:10,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 155 transitions, 2516 flow [2022-12-06 01:14:10,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 155 transitions, 2516 flow [2022-12-06 01:14:10,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:10,388 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:14:10,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 01:14:10,390 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 155 transitions, 2516 flow [2022-12-06 01:14:10,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:10,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:10,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:10,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:14:10,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1606554066, now seen corresponding path program 1 times [2022-12-06 01:14:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027558307] [2022-12-06 01:14:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027558307] [2022-12-06 01:14:10,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027558307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:10,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:10,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966131890] [2022-12-06 01:14:10,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:10,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:14:10,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:10,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:14:10,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:14:10,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:14:10,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 155 transitions, 2516 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:10,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:10,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:14:10,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:10,753 INFO L130 PetriNetUnfolder]: 582/986 cut-off events. [2022-12-06 01:14:10,753 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 01:14:10,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8940 conditions, 986 events. 582/986 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4619 event pairs, 4 based on Foata normal form. 19/1005 useless extension candidates. Maximal degree in co-relation 8908. Up to 987 conditions per place. [2022-12-06 01:14:10,758 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 188 selfloop transitions, 46 changer transitions 81/315 dead transitions. [2022-12-06 01:14:10,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 315 transitions, 5727 flow [2022-12-06 01:14:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:14:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:14:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 01:14:10,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 01:14:10,763 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2022-12-06 01:14:10,763 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:10,763 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 315 transitions, 5727 flow [2022-12-06 01:14:10,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 315 transitions, 5727 flow [2022-12-06 01:14:10,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:14:50,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:14:50,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40086 [2022-12-06 01:14:50,849 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 317 transitions, 5935 flow [2022-12-06 01:14:50,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:50,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:14:50,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:14:50,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:14:50,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:14:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:14:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1831360637, now seen corresponding path program 1 times [2022-12-06 01:14:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:14:50,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124026684] [2022-12-06 01:14:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:14:50,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:14:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:14:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:14:51,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:14:51,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124026684] [2022-12-06 01:14:51,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124026684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:14:51,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:14:51,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:14:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999003966] [2022-12-06 01:14:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:14:51,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:14:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:14:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:14:51,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:14:51,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 01:14:51,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 317 transitions, 5935 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:14:51,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:14:51,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 01:14:51,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:14:51,316 INFO L130 PetriNetUnfolder]: 366/690 cut-off events. [2022-12-06 01:14:51,316 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 01:14:51,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 690 events. 366/690 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3287 event pairs, 0 based on Foata normal form. 14/704 useless extension candidates. Maximal degree in co-relation 6932. Up to 691 conditions per place. [2022-12-06 01:14:51,321 INFO L137 encePairwiseOnDemand]: 41/47 looper letters, 148 selfloop transitions, 49 changer transitions 161/358 dead transitions. [2022-12-06 01:14:51,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 358 transitions, 7220 flow [2022-12-06 01:14:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:14:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:14:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 01:14:51,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23404255319148937 [2022-12-06 01:14:51,323 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2022-12-06 01:14:51,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:14:51,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 358 transitions, 7220 flow [2022-12-06 01:14:51,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 358 transitions, 7220 flow [2022-12-06 01:14:51,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:16,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:16,380 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25057 [2022-12-06 01:15:16,381 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 358 transitions, 7318 flow [2022-12-06 01:15:16,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:16,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:16,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:16,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:15:16,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash 83301168, now seen corresponding path program 1 times [2022-12-06 01:15:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314103581] [2022-12-06 01:15:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:17,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314103581] [2022-12-06 01:15:17,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314103581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:17,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:17,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:15:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179998898] [2022-12-06 01:15:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:17,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:15:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:15:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:15:17,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 01:15:17,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 358 transitions, 7318 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:17,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:17,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 01:15:17,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:17,758 INFO L130 PetriNetUnfolder]: 285/549 cut-off events. [2022-12-06 01:15:17,758 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 01:15:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 549 events. 285/549 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2479 event pairs, 0 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 6069. Up to 550 conditions per place. [2022-12-06 01:15:17,766 INFO L137 encePairwiseOnDemand]: 30/36 looper letters, 161 selfloop transitions, 58 changer transitions 119/338 dead transitions. [2022-12-06 01:15:17,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 338 transitions, 7496 flow [2022-12-06 01:15:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:15:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:15:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-12-06 01:15:17,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18981481481481483 [2022-12-06 01:15:17,768 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2022-12-06 01:15:17,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:17,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 338 transitions, 7496 flow [2022-12-06 01:15:17,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 338 transitions, 7496 flow [2022-12-06 01:15:17,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:26,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:26,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8311 [2022-12-06 01:15:26,079 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 338 transitions, 7500 flow [2022-12-06 01:15:26,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:26,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:26,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:15:26,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash -744934404, now seen corresponding path program 1 times [2022-12-06 01:15:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:26,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853665737] [2022-12-06 01:15:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853665737] [2022-12-06 01:15:26,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853665737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:26,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:26,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:15:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778250979] [2022-12-06 01:15:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:15:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:15:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:15:26,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 01:15:26,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 338 transitions, 7500 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:26,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:26,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 01:15:26,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:26,537 INFO L130 PetriNetUnfolder]: 279/538 cut-off events. [2022-12-06 01:15:26,537 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 01:15:26,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6525 conditions, 538 events. 279/538 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2423 event pairs, 0 based on Foata normal form. 5/543 useless extension candidates. Maximal degree in co-relation 6484. Up to 539 conditions per place. [2022-12-06 01:15:26,541 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 72 selfloop transitions, 46 changer transitions 220/338 dead transitions. [2022-12-06 01:15:26,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 338 transitions, 8172 flow [2022-12-06 01:15:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:15:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:15:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 01:15:26,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 01:15:26,545 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2022-12-06 01:15:26,545 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:26,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 338 transitions, 8172 flow [2022-12-06 01:15:26,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 338 transitions, 8172 flow [2022-12-06 01:15:26,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:16:01,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:16:01,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34507 [2022-12-06 01:16:01,052 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 337 transitions, 8190 flow [2022-12-06 01:16:01,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:01,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:16:01,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:16:01,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:16:01,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:16:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:16:01,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1626559749, now seen corresponding path program 1 times [2022-12-06 01:16:01,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:16:01,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093822122] [2022-12-06 01:16:01,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:16:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:16:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:16:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:16:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:16:01,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093822122] [2022-12-06 01:16:01,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093822122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:16:01,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:16:01,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:16:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910151933] [2022-12-06 01:16:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:16:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:16:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:16:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:16:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:16:01,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 01:16:01,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 337 transitions, 8190 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:01,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:16:01,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 01:16:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:16:02,061 INFO L130 PetriNetUnfolder]: 338/657 cut-off events. [2022-12-06 01:16:02,062 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-06 01:16:02,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8631 conditions, 657 events. 338/657 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3199 event pairs, 0 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 8587. Up to 658 conditions per place. [2022-12-06 01:16:02,066 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 60 selfloop transitions, 27 changer transitions 342/429 dead transitions. [2022-12-06 01:16:02,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 429 transitions, 11241 flow [2022-12-06 01:16:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:16:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:16:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 01:16:02,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2962962962962963 [2022-12-06 01:16:02,068 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2022-12-06 01:16:02,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:16:02,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 429 transitions, 11241 flow [2022-12-06 01:16:02,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 429 transitions, 11241 flow [2022-12-06 01:16:02,081 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:16:38,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L836-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:39,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:41,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] L800-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:42,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L836-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:44,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:45,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] L800-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:46,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L836-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:48,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] L800-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:49,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:51,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:52,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L836-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:53,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [824] L800-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_78 1) v_~__unbuffered_cnt~0_77) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [899] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_442 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_755 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse20 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_755))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse19))) (let ((.cse17 (= (mod v_~x$w_buff1_used~0_745 256) 0)) (.cse16 (= (mod v_~x$r_buff1_thd0~0_437 256) 0)) (.cse25 (ite .cse31 0 v_~x$r_buff0_thd0~0_442))) (let ((.cse26 (= (mod .cse25 256) 0)) (.cse13 (not .cse16)) (.cse15 (not .cse17))) (let ((.cse28 (ite (or (and .cse13 .cse15) .cse31) 0 v_~x$w_buff1_used~0_745)) (.cse27 (not .cse26))) (let ((.cse24 (and .cse27 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse6 (ite (or .cse24 (and .cse13 (not .cse29))) 0 v_~x$r_buff1_thd0~0_437))) (let ((.cse8 (= (mod .cse6 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_348 256) 0))) (let ((.cse0 (select |v_#memory_int_889| |v_~#x~0.base_460|)) (.cse10 (= (mod v_~x$w_buff1_used~0_744 256) 0)) (.cse2 (not .cse1)) (.cse21 (and .cse26 .cse8)) (.cse22 (and .cse29 .cse26)) (.cse9 (= (mod v_~x$w_buff0_used~0_754 256) 0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_183| 0)) (= v_~x$w_buff0~0_598 v_~x$w_buff0~0_597) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163| (mod v_~main$tmp_guard0~0_180 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| (mod v_~main$tmp_guard1~0_194 256)) (= v_~x$flush_delayed~0_326 0) (= |v_ULTIMATE.start_main_#t~nondet43#1_351| v_~weak$$choice2~0_348) (= (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| |v_ULTIMATE.start_main_#t~ite53#1_355|)) |v_#memory_int_888|) (= v_~x$w_buff1~0_584 v_~x$w_buff1~0_583) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|) (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_477| |v_ULTIMATE.start_main_#t~ite53#1_355|) (= |v_ULTIMATE.start_main_#t~mem52#1_477| v_~x$mem_tmp~0_280) .cse1) (and (= v_~x$mem_tmp~0_280 |v_ULTIMATE.start_main_#t~ite53#1_355|) .cse2 (= |v_ULTIMATE.start_main_#t~mem52#1_479| |v_ULTIMATE.start_main_#t~mem52#1_477|))) (let ((.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_216 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem48#1_509| |v_ULTIMATE.start_main_#t~mem48#1_507|))) (or (and (not .cse3) (let ((.cse4 (= (mod v_~weak$$choice1~0_276 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem48#1_507| (select (select (store |v_#memory_int_889| |v_~#x~0.base_460| (store .cse0 |v_~#x~0.offset_460| v_~x$mem_tmp~0_280)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_507| |v_ULTIMATE.start_main_#t~ite49#1_502|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_393) .cse5))) (= |v_ULTIMATE.start_main_#t~ite49#1_502| v_~__unbuffered_p2_EAX~0_392)) (and (= v_~__unbuffered_p2_EAX~0_393 v_~__unbuffered_p2_EAX~0_392) .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_504| |v_ULTIMATE.start_main_#t~ite49#1_502|) .cse5))) (= v_~x$r_buff1_thd0~0_436 (ite .cse2 .cse6 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_441 256) 0))) (or (and .cse7 .cse8) .cse9 (and .cse7 .cse10))) .cse6 0))) (= v_~main$tmp_guard0~0_180 (ite (= (ite (= v_~__unbuffered_cnt~0_211 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_137| 0) (= v_~weak$$choice1~0_276 |v_ULTIMATE.start_main_#t~nondet47#1_341|) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_488| |v_ULTIMATE.start_main_#t~mem39#1_486|))) (or (and (= |v_ULTIMATE.start_main_#t~ite40#1_485| v_~x$mem_tmp~0_280) (or .cse11 .cse12) (or (and .cse13 (= v_~x$w_buff1~0_584 |v_ULTIMATE.start_main_#t~ite40#1_485|) .cse14 .cse15) (and (or .cse16 .cse17) (= |v_ULTIMATE.start_main_#t~mem39#1_486| |v_ULTIMATE.start_main_#t~ite40#1_485|) (= |v_ULTIMATE.start_main_#t~mem39#1_486| (select .cse0 |v_~#x~0.offset_460|))))) (and (= v_~x$w_buff0~0_598 v_~x$mem_tmp~0_280) .cse14 .cse18 (= |v_ULTIMATE.start_main_#t~ite40#1_485| |v_ULTIMATE.start_main_#t~ite40#1_487|) .cse19))) (= v_~x$w_buff0_used~0_754 (ite .cse2 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= v_~x$r_buff0_thd0~0_441 (ite .cse2 .cse25 (ite (or .cse21 (and .cse26 .cse10) .cse9) .cse25 (ite (and .cse27 (not .cse9)) 0 .cse25)))) (= v_~weak$$choice0~0_317 |v_ULTIMATE.start_main_#t~nondet42#1_339|) (= v_~x$w_buff1_used~0_744 (ite .cse2 .cse28 (ite (or .cse21 .cse22 .cse9) .cse28 0))) (= (ite (= (ite (not (and (= v_~y~0_179 2) (= 2 v_~__unbuffered_p2_EAX~0_392) (= 2 v_~x$mem_tmp~0_280) (= v_~__unbuffered_p0_EAX~0_182 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_194))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_598, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_504|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_341|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_339|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_393, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_351|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_509|, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_479|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_488|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_487|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_442, ~#x~0.offset=|v_~#x~0.offset_460|, ~x$w_buff1~0=v_~x$w_buff1~0_584, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_437, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_889|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_597, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_201|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_137|, ~x$flush_delayed~0=v_~x$flush_delayed~0_326, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_217, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_217, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_194, ~x$mem_tmp~0=v_~x$mem_tmp~0_280, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_159|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_199|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_276, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_242|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_183|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_392, ~y~0=v_~y~0_179, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_354|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_441, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_165|, ~#x~0.offset=|v_~#x~0.offset_460|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_274|, ~x$w_buff1~0=v_~x$w_buff1~0_583, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_744, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_436, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_204|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_216, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_754, ~weak$$choice0~0=v_~weak$$choice0~0_317, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_131|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_259|, #memory_int=|v_#memory_int_888|, ~#x~0.base=|v_~#x~0.base_460|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~weak$$choice2~0=v_~weak$$choice2~0_348, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_163|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_485|, |v_ULTIMATE.start_main_#t~mem52#1_477|, |v_ULTIMATE.start_main_#t~ite53#1_355|, |v_ULTIMATE.start_main_#t~ite49#1_502|, |v_ULTIMATE.start_main_#t~mem39#1_486|, |v_ULTIMATE.start_main_#t~mem48#1_507|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 01:16:55,077 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:16:55,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53010 [2022-12-06 01:16:55,078 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 416 transitions, 10951 flow [2022-12-06 01:16:55,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:55,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:16:55,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:16:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:16:55,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:16:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:16:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1748378077, now seen corresponding path program 1 times [2022-12-06 01:16:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:16:55,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107477697] [2022-12-06 01:16:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:16:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:16:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:16:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:16:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:16:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107477697] [2022-12-06 01:16:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107477697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:16:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:16:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:16:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472329739] [2022-12-06 01:16:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:16:55,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:16:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:16:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:16:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:16:55,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 01:16:55,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 416 transitions, 10951 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:55,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:16:55,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 01:16:55,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:16:56,292 INFO L130 PetriNetUnfolder]: 368/733 cut-off events. [2022-12-06 01:16:56,292 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-06 01:16:56,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10368 conditions, 733 events. 368/733 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3852 event pairs, 0 based on Foata normal form. 3/736 useless extension candidates. Maximal degree in co-relation 10321. Up to 734 conditions per place. [2022-12-06 01:16:56,295 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 37 selfloop transitions, 12 changer transitions 428/477 dead transitions. [2022-12-06 01:16:56,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 477 transitions, 13464 flow [2022-12-06 01:16:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:16:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:16:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-12-06 01:16:56,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23645320197044334 [2022-12-06 01:16:56,297 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 01:16:56,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:16:56,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 477 transitions, 13464 flow [2022-12-06 01:16:56,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 477 transitions, 13464 flow [2022-12-06 01:16:56,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:16:56,310 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:16:56,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 01:16:56,311 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 477 transitions, 13464 flow [2022-12-06 01:16:56,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:56,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:16:56,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:16:56,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:16:56,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:16:56,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:16:56,311 INFO L85 PathProgramCache]: Analyzing trace with hash 132185413, now seen corresponding path program 1 times [2022-12-06 01:16:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:16:56,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260236008] [2022-12-06 01:16:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:16:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:16:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:16:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:16:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:16:57,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260236008] [2022-12-06 01:16:57,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260236008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:16:57,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:16:57,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 01:16:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751628765] [2022-12-06 01:16:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:16:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 01:16:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:16:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 01:16:57,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 01:16:57,442 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:16:57,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 477 transitions, 13464 flow. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:57,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:16:57,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:16:57,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:16:57,868 INFO L130 PetriNetUnfolder]: 391/788 cut-off events. [2022-12-06 01:16:57,869 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 01:16:57,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11935 conditions, 788 events. 391/788 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4287 event pairs, 0 based on Foata normal form. 3/791 useless extension candidates. Maximal degree in co-relation 11885. Up to 789 conditions per place. [2022-12-06 01:16:57,872 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 27 selfloop transitions, 7 changer transitions 480/514 dead transitions. [2022-12-06 01:16:57,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 514 transitions, 15537 flow [2022-12-06 01:16:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:16:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:16:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 01:16:57,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 01:16:57,874 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2022-12-06 01:16:57,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:16:57,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 514 transitions, 15537 flow [2022-12-06 01:16:57,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 514 transitions, 15537 flow [2022-12-06 01:16:57,884 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:16:57,885 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:16:57,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 01:16:57,886 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 514 transitions, 15537 flow [2022-12-06 01:16:57,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:16:57,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:16:57,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:16:57,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:16:57,886 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:16:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:16:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1928969129, now seen corresponding path program 1 times [2022-12-06 01:16:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:16:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430323270] [2022-12-06 01:16:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:16:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:16:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:16:57,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 01:16:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:16:58,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 01:16:58,047 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 01:16:58,047 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:16:58,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:16:58,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:16:58,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:16:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:16:58,050 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:16:58,053 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:16:58,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:16:58,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:16:58 BasicIcfg [2022-12-06 01:16:58,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:16:58,124 INFO L158 Benchmark]: Toolchain (without parser) took 195677.62ms. Allocated memory was 191.9MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 166.0MB in the beginning and 883.5MB in the end (delta: -717.6MB). Peak memory consumption was 245.6MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,124 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:16:58,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.27ms. Allocated memory is still 191.9MB. Free memory was 165.5MB in the beginning and 136.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 191.9MB. Free memory was 136.0MB in the beginning and 133.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,125 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 191.9MB. Free memory was 133.0MB in the beginning and 130.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,125 INFO L158 Benchmark]: RCFGBuilder took 907.68ms. Allocated memory was 191.9MB in the beginning and 250.6MB in the end (delta: 58.7MB). Free memory was 130.5MB in the beginning and 221.9MB in the end (delta: -91.3MB). Peak memory consumption was 55.2MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,125 INFO L158 Benchmark]: TraceAbstraction took 194183.19ms. Allocated memory was 250.6MB in the beginning and 1.2GB in the end (delta: 903.9MB). Free memory was 220.8MB in the beginning and 883.5MB in the end (delta: -662.7MB). Peak memory consumption was 241.7MB. Max. memory is 8.0GB. [2022-12-06 01:16:58,126 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.27ms. Allocated memory is still 191.9MB. Free memory was 165.5MB in the beginning and 136.0MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 191.9MB. Free memory was 136.0MB in the beginning and 133.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 191.9MB. Free memory was 133.0MB in the beginning and 130.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 907.68ms. Allocated memory was 191.9MB in the beginning and 250.6MB in the end (delta: 58.7MB). Free memory was 130.5MB in the beginning and 221.9MB in the end (delta: -91.3MB). Peak memory consumption was 55.2MB. Max. memory is 8.0GB. * TraceAbstraction took 194183.19ms. Allocated memory was 250.6MB in the beginning and 1.2GB in the end (delta: 903.9MB). Free memory was 220.8MB in the beginning and 883.5MB in the end (delta: -662.7MB). Peak memory consumption was 241.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 118 PlacesBefore, 30 PlacesAfterwards, 109 TransitionsBefore, 21 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 772, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 818, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 694, independent: 661, independent conditional: 0, independent unconditional: 661, 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: 694, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 462, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 430, dependent conditional: 0, dependent unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 818, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 694, unknown conditional: 0, unknown unconditional: 694] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 973, Positive conditional cache size: 0, Positive unconditional cache size: 973, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 31 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 31 PlacesBefore, 31 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 33 PlacesBefore, 33 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 35 PlacesBefore, 35 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.1s, 47 PlacesBefore, 48 PlacesAfterwards, 315 TransitionsBefore, 317 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.0s, 52 PlacesBefore, 52 PlacesAfterwards, 358 TransitionsBefore, 358 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 57 PlacesBefore, 57 PlacesAfterwards, 338 TransitionsBefore, 338 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.5s, 62 PlacesBefore, 61 PlacesAfterwards, 338 TransitionsBefore, 337 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 53.0s, 64 PlacesBefore, 63 PlacesAfterwards, 429 TransitionsBefore, 416 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 477 TransitionsBefore, 477 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 514 TransitionsBefore, 514 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2124, ((void *)0), P0, ((void *)0))=9, t2124={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2125, ((void *)0), P1, ((void *)0))=10, t2124={7:0}, t2125={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2126, ((void *)0), P2, ((void *)0))=11, t2124={7:0}, t2125={8:0}, t2126={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] EXPR 3 \read(x) [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L828] 3 y = 1 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L759] 1 y = 2 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !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) [L768] EXPR 1 \read(x) [L768] EXPR 1 !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) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L792] 2 x = 2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=255, weak$$choice2=255, x={3: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L860] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L862] RET 2 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 2 \read(x) [L864] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 2 x$flush_delayed = weak$$choice2 [L874] EXPR 2 \read(x) [L874] 2 x$mem_tmp = x [L875] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] EXPR 2 \read(x) [L875] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 2 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 2 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 2 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 2 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 2 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 2 \read(x) [L884] 2 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L885] 2 x = x$flush_delayed ? x$mem_tmp : x [L886] 2 x$flush_delayed = (_Bool)0 [L888] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2] - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: 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 7 procedures, 149 locations, 4 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: 194.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 928 IncrementalHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 0 mSDtfsCounter, 928 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15537occurred in iteration=14, InterpolantAutomatonStates: 62, 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.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 2453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 01:16:58,165 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...