/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:37:13,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:37:13,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:37:13,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:37:13,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:37:13,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:37:13,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:37:13,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:37:13,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:37:13,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:37:13,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:37:13,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:37:13,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:37:13,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:37:13,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:37:13,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:37:13,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:37:13,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:37:13,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:37:13,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:37:13,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:37:13,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:37:13,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:37:13,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:37:13,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:37:13,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:37:13,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:37:13,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:37:13,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:37:13,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:37:13,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:37:13,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:37:13,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:37:13,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:37:13,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:37:13,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:37:13,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:37:13,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:37:13,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:37:13,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:37:13,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:37:13,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:37:13,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:37:13,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:37:13,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:37:13,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:37:13,380 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:37:13,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:37:13,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:37:13,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:37:13,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:37:13,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:37:13,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:37:13,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:37:13,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:37:13,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:37:13,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:37:13,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:37:13,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:13,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:37:13,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:37:13,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:37:13,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:37:13,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:37:13,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:37:13,750 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:37:13,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2022-12-06 06:37:14,958 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:37:15,185 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:37:15,186 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2022-12-06 06:37:15,201 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7e9ac63/8bd56085b793424f90676ae10bcde02c/FLAGf45c08ffb [2022-12-06 06:37:15,214 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7e9ac63/8bd56085b793424f90676ae10bcde02c [2022-12-06 06:37:15,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:37:15,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:37:15,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:15,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:37:15,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:37:15,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655ee092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15, skipping insertion in model container [2022-12-06 06:37:15,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:37:15,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:37:15,427 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/safe009_power.oepc.i[995,1008] [2022-12-06 06:37:15,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:15,659 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:37:15,671 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/safe009_power.oepc.i[995,1008] [2022-12-06 06:37:15,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:37:15,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:37:15,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:37:15,775 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:37:15,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15 WrapperNode [2022-12-06 06:37:15,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:37:15,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:15,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:37:15,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:37:15,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,848 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-12-06 06:37:15,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:37:15,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:37:15,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:37:15,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:37:15,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:37:15,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:37:15,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:37:15,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:37:15,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (1/1) ... [2022-12-06 06:37:15,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:37:15,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:37:15,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:37:15,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:37:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:37:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:37:15,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:37:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:37:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:37:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:37:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:37:15,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:37:15,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:37:15,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:37:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:37:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:37:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:37:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:37:15,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:37:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:37:15,984 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:37:16,186 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:37:16,188 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:37:16,562 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:37:16,945 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:37:16,945 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:37:16,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:16 BoogieIcfgContainer [2022-12-06 06:37:16,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:37:16,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:37:16,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:37:16,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:37:16,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:37:15" (1/3) ... [2022-12-06 06:37:16,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4929a384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:16, skipping insertion in model container [2022-12-06 06:37:16,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:15" (2/3) ... [2022-12-06 06:37:16,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4929a384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:16, skipping insertion in model container [2022-12-06 06:37:16,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:16" (3/3) ... [2022-12-06 06:37:16,955 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2022-12-06 06:37:16,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:37:16,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:37:16,972 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:37:17,038 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:37:17,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 06:37:17,145 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-06 06:37:17,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:17,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-06 06:37:17,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 06:37:17,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-06 06:37:17,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:17,178 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 06:37:17,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-06 06:37:17,224 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-06 06:37:17,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 06:37:17,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 06:37:17,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 06:37:29,476 INFO L203 LiptonReduction]: Total number of compositions: 90 [2022-12-06 06:37:29,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:37:29,502 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;@3cfda762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:37:29,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:37:29,507 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-06 06:37:29,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:29,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:29,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:29,509 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 06:37:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1477579292, now seen corresponding path program 1 times [2022-12-06 06:37:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:29,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517229653] [2022-12-06 06:37:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:29,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:29,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:29,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517229653] [2022-12-06 06:37:29,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517229653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:29,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:29,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384375255] [2022-12-06 06:37:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:29,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:37:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:37:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:37:29,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:37:29,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 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 06:37:29,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:29,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:37:29,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:30,037 INFO L130 PetriNetUnfolder]: 407/638 cut-off events. [2022-12-06 06:37:30,038 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:37:30,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 638 events. 407/638 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2578 event pairs, 407 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 1294. Up to 631 conditions per place. [2022-12-06 06:37:30,047 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 06:37:30,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 81 flow [2022-12-06 06:37:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:37:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:37:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2022-12-06 06:37:30,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:37:30,059 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 22 transitions. [2022-12-06 06:37:30,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 81 flow [2022-12-06 06:37:30,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:30,063 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 06:37:30,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 06:37:30,068 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 06:37:30,068 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:30,069 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 06:37:30,071 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:30,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:30,072 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 06:37:30,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 06:37:30,090 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:37:30,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:30,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-06 06:37:30,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 06:37:30,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 06:37:30,376 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:30,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-06 06:37:30,378 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 06:37:30,378 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 06:37:30,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:30,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:30,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:37:30,379 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 06:37:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:30,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1680453866, now seen corresponding path program 1 times [2022-12-06 06:37:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438014841] [2022-12-06 06:37:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438014841] [2022-12-06 06:37:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438014841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:30,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:30,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758702861] [2022-12-06 06:37:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:30,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:30,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:30,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:37:30,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 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 06:37:30,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:30,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:37:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:31,032 INFO L130 PetriNetUnfolder]: 378/633 cut-off events. [2022-12-06 06:37:31,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 633 events. 378/633 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2820 event pairs, 72 based on Foata normal form. 12/644 useless extension candidates. Maximal degree in co-relation 1248. Up to 493 conditions per place. [2022-12-06 06:37:31,038 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-06 06:37:31,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 116 flow [2022-12-06 06:37:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:37:31,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 06:37:31,040 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:37:31,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 116 flow [2022-12-06 06:37:31,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:37:31,042 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 06:37:31,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 06:37:31,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:31,043 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:31,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:31,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,050 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:37:31,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:31,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 06:37:31,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:31,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:37:31,054 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 06:37:31,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 06:37:31,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:31,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:31,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:37:31,055 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 06:37:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:31,056 INFO L85 PathProgramCache]: Analyzing trace with hash 554462372, now seen corresponding path program 1 times [2022-12-06 06:37:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:31,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849609766] [2022-12-06 06:37:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:31,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849609766] [2022-12-06 06:37:31,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849609766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:31,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:31,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225150911] [2022-12-06 06:37:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:31,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:31,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:37:31,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 06:37:31,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:31,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:37:31,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:31,562 INFO L130 PetriNetUnfolder]: 597/970 cut-off events. [2022-12-06 06:37:31,565 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-12-06 06:37:31,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 970 events. 597/970 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4562 event pairs, 199 based on Foata normal form. 48/1016 useless extension candidates. Maximal degree in co-relation 2092. Up to 328 conditions per place. [2022-12-06 06:37:31,570 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 3 changer transitions 5/41 dead transitions. [2022-12-06 06:37:31,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 185 flow [2022-12-06 06:37:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:37:31,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 06:37:31,572 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:37:31,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 185 flow [2022-12-06 06:37:31,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:31,574 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 62 flow [2022-12-06 06:37:31,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 06:37:31,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 06:37:31,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:31,575 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 06:37:31,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:31,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:31,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 06:37:31,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 19 transitions, 62 flow [2022-12-06 06:37:31,583 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:37:31,583 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 06:37:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 19 events. 0/19 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:31,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 19 transitions, 62 flow [2022-12-06 06:37:31,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 06:37:32,966 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:32,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1392 [2022-12-06 06:37:32,967 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2022-12-06 06:37:32,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 06:37:32,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:32,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:32,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:37:32,968 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 06:37:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1085847434, now seen corresponding path program 1 times [2022-12-06 06:37:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:32,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401486966] [2022-12-06 06:37:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:34,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401486966] [2022-12-06 06:37:34,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401486966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:34,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:34,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:37:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462608052] [2022-12-06 06:37:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:34,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:37:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:37:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:37:34,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 06:37:34,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 06:37:34,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:34,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 06:37:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:34,613 INFO L130 PetriNetUnfolder]: 315/506 cut-off events. [2022-12-06 06:37:34,613 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2022-12-06 06:37:34,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 506 events. 315/506 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1718 event pairs, 99 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 1242. Up to 450 conditions per place. [2022-12-06 06:37:34,617 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-06 06:37:34,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 142 flow [2022-12-06 06:37:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 06:37:34,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 06:37:34,620 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 28 transitions. [2022-12-06 06:37:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 142 flow [2022-12-06 06:37:34,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 125 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:37:34,623 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 67 flow [2022-12-06 06:37:34,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 06:37:34,625 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 06:37:34,625 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:34,625 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 67 flow [2022-12-06 06:37:34,626 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:34,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:34,629 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 67 flow [2022-12-06 06:37:34,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 67 flow [2022-12-06 06:37:34,639 INFO L130 PetriNetUnfolder]: 3/28 cut-off events. [2022-12-06 06:37:34,640 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:37:34,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2022-12-06 06:37:34,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 67 flow [2022-12-06 06:37:34,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:37:34,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:34,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 06:37:34,768 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 69 flow [2022-12-06 06:37:34,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 06:37:34,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:34,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:34,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:37:34,769 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 06:37:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1085846659, now seen corresponding path program 1 times [2022-12-06 06:37:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:34,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274248003] [2022-12-06 06:37:34,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:34,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:35,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:35,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274248003] [2022-12-06 06:37:35,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274248003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:35,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:35,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:35,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898385328] [2022-12-06 06:37:35,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:35,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:35,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:35,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:37:35,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 69 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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 06:37:35,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:35,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:37:35,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:35,361 INFO L130 PetriNetUnfolder]: 371/594 cut-off events. [2022-12-06 06:37:35,362 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 06:37:35,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 594 events. 371/594 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2149 event pairs, 254 based on Foata normal form. 8/602 useless extension candidates. Maximal degree in co-relation 1434. Up to 525 conditions per place. [2022-12-06 06:37:35,366 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 21 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2022-12-06 06:37:35,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 149 flow [2022-12-06 06:37:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 06:37:35,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-12-06 06:37:35,369 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 69 flow. Second operand 4 states and 29 transitions. [2022-12-06 06:37:35,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 149 flow [2022-12-06 06:37:35,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:37:35,373 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 113 flow [2022-12-06 06:37:35,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-06 06:37:35,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 06:37:35,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:35,377 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 113 flow [2022-12-06 06:37:35,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:35,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:35,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 113 flow [2022-12-06 06:37:35,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 113 flow [2022-12-06 06:37:35,399 INFO L130 PetriNetUnfolder]: 35/90 cut-off events. [2022-12-06 06:37:35,400 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-12-06 06:37:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 90 events. 35/90 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 18 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 220. Up to 61 conditions per place. [2022-12-06 06:37:35,401 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 113 flow [2022-12-06 06:37:35,401 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 06:37:38,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:38,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3276 [2022-12-06 06:37:38,653 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 117 flow [2022-12-06 06:37:38,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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 06:37:38,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:38,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:38,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:37:38,654 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 06:37:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1004857916, now seen corresponding path program 1 times [2022-12-06 06:37:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020547859] [2022-12-06 06:37:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020547859] [2022-12-06 06:37:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020547859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:39,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:37:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445332424] [2022-12-06 06:37:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:39,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:37:39,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:37:39,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:37:39,072 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:37:39,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 117 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:39,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:39,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:37:39,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:39,278 INFO L130 PetriNetUnfolder]: 363/586 cut-off events. [2022-12-06 06:37:39,279 INFO L131 PetriNetUnfolder]: For 356/356 co-relation queries the response was YES. [2022-12-06 06:37:39,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 586 events. 363/586 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2142 event pairs, 254 based on Foata normal form. 8/594 useless extension candidates. Maximal degree in co-relation 1709. Up to 517 conditions per place. [2022-12-06 06:37:39,283 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 21 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2022-12-06 06:37:39,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 174 flow [2022-12-06 06:37:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:37:39,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 06:37:39,285 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 117 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:37:39,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 174 flow [2022-12-06 06:37:39,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:39,289 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,289 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 06:37:39,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-06 06:37:39,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:39,292 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:39,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:39,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,313 INFO L130 PetriNetUnfolder]: 32/86 cut-off events. [2022-12-06 06:37:39,313 INFO L131 PetriNetUnfolder]: For 52/53 co-relation queries the response was YES. [2022-12-06 06:37:39,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 86 events. 32/86 cut-off events. For 52/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 285 event pairs, 11 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 217. Up to 58 conditions per place. [2022-12-06 06:37:39,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 06:37:39,315 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:39,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:37:39,316 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 112 flow [2022-12-06 06:37:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:39,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:39,317 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:37:39,317 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 06:37:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -886897339, now seen corresponding path program 2 times [2022-12-06 06:37:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:39,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609115135] [2022-12-06 06:37:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:40,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609115135] [2022-12-06 06:37:40,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609115135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:40,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:37:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550045613] [2022-12-06 06:37:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:40,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:37:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:37:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:37:40,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:37:40,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 112 flow. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 06:37:40,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:40,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:37:40,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:40,470 INFO L130 PetriNetUnfolder]: 358/579 cut-off events. [2022-12-06 06:37:40,471 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-06 06:37:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 579 events. 358/579 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2116 event pairs, 249 based on Foata normal form. 2/581 useless extension candidates. Maximal degree in co-relation 1711. Up to 498 conditions per place. [2022-12-06 06:37:40,475 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 23 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2022-12-06 06:37:40,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 198 flow [2022-12-06 06:37:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-06 06:37:40,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-12-06 06:37:40,476 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 112 flow. Second operand 4 states and 29 transitions. [2022-12-06 06:37:40,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 198 flow [2022-12-06 06:37:40,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:40,478 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 06:37:40,479 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-06 06:37:40,479 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:40,479 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:40,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:40,480 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,499 INFO L130 PetriNetUnfolder]: 30/83 cut-off events. [2022-12-06 06:37:40,499 INFO L131 PetriNetUnfolder]: For 93/94 co-relation queries the response was YES. [2022-12-06 06:37:40,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 83 events. 30/83 cut-off events. For 93/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 285 event pairs, 11 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 245. Up to 55 conditions per place. [2022-12-06 06:37:40,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 06:37:40,502 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:40,503 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:37:40,503 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 137 flow [2022-12-06 06:37:40,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 06:37:40,503 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:40,503 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:40,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:37:40,503 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 06:37:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash -878004214, now seen corresponding path program 1 times [2022-12-06 06:37:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475381055] [2022-12-06 06:37:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475381055] [2022-12-06 06:37:41,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475381055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:41,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:41,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320758522] [2022-12-06 06:37:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:41,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:37:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:41,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:37:41,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:37:41,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:37:41,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 137 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 06:37:41,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:41,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:37:41,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:41,720 INFO L130 PetriNetUnfolder]: 462/763 cut-off events. [2022-12-06 06:37:41,721 INFO L131 PetriNetUnfolder]: For 888/888 co-relation queries the response was YES. [2022-12-06 06:37:41,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2348 conditions, 763 events. 462/763 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3253 event pairs, 164 based on Foata normal form. 20/783 useless extension candidates. Maximal degree in co-relation 2333. Up to 472 conditions per place. [2022-12-06 06:37:41,726 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 31 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2022-12-06 06:37:41,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 270 flow [2022-12-06 06:37:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-06 06:37:41,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4105263157894737 [2022-12-06 06:37:41,727 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 137 flow. Second operand 5 states and 39 transitions. [2022-12-06 06:37:41,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 270 flow [2022-12-06 06:37:41,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 259 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:41,731 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 06:37:41,732 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-06 06:37:41,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:41,733 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:41,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:41,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,756 INFO L130 PetriNetUnfolder]: 31/106 cut-off events. [2022-12-06 06:37:41,756 INFO L131 PetriNetUnfolder]: For 127/128 co-relation queries the response was YES. [2022-12-06 06:37:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 106 events. 31/106 cut-off events. For 127/128 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 427 event pairs, 16 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 312. Up to 67 conditions per place. [2022-12-06 06:37:41,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:37:41,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:41,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 06:37:41,760 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 170 flow [2022-12-06 06:37:41,760 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 06:37:41,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:41,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:41,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:37:41,760 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 06:37:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2113348139, now seen corresponding path program 1 times [2022-12-06 06:37:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285615511] [2022-12-06 06:37:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:41,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:41,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285615511] [2022-12-06 06:37:41,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285615511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:41,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:41,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:37:41,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819231544] [2022-12-06 06:37:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:41,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:41,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:37:41,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:41,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:41,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:37:41,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:42,143 INFO L130 PetriNetUnfolder]: 376/675 cut-off events. [2022-12-06 06:37:42,144 INFO L131 PetriNetUnfolder]: For 1121/1142 co-relation queries the response was YES. [2022-12-06 06:37:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 675 events. 376/675 cut-off events. For 1121/1142 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3152 event pairs, 65 based on Foata normal form. 84/758 useless extension candidates. Maximal degree in co-relation 2145. Up to 458 conditions per place. [2022-12-06 06:37:42,148 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 44 selfloop transitions, 4 changer transitions 34/83 dead transitions. [2022-12-06 06:37:42,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 83 transitions, 662 flow [2022-12-06 06:37:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 06:37:42,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:37:42,152 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 170 flow. Second operand 5 states and 57 transitions. [2022-12-06 06:37:42,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 83 transitions, 662 flow [2022-12-06 06:37:42,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 83 transitions, 623 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:42,156 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 192 flow [2022-12-06 06:37:42,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 06:37:42,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-06 06:37:42,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:42,157 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 192 flow [2022-12-06 06:37:42,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:42,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:42,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 192 flow [2022-12-06 06:37:42,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 192 flow [2022-12-06 06:37:42,199 INFO L130 PetriNetUnfolder]: 116/260 cut-off events. [2022-12-06 06:37:42,199 INFO L131 PetriNetUnfolder]: For 360/380 co-relation queries the response was YES. [2022-12-06 06:37:42,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 260 events. 116/260 cut-off events. For 360/380 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1288 event pairs, 57 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 863. Up to 127 conditions per place. [2022-12-06 06:37:42,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 192 flow [2022-12-06 06:37:42,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:37:42,203 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:42,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:37:42,204 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 192 flow [2022-12-06 06:37:42,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:42,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:42,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:42,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:37:42,205 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 06:37:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash -375270227, now seen corresponding path program 1 times [2022-12-06 06:37:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:42,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742730119] [2022-12-06 06:37:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:42,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742730119] [2022-12-06 06:37:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742730119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:42,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:42,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136665758] [2022-12-06 06:37:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:37:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:37:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:37:42,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:37:42,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:42,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:42,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:37:42,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:42,595 INFO L130 PetriNetUnfolder]: 198/391 cut-off events. [2022-12-06 06:37:42,595 INFO L131 PetriNetUnfolder]: For 814/826 co-relation queries the response was YES. [2022-12-06 06:37:42,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 391 events. 198/391 cut-off events. For 814/826 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1692 event pairs, 19 based on Foata normal form. 57/447 useless extension candidates. Maximal degree in co-relation 1556. Up to 182 conditions per place. [2022-12-06 06:37:42,598 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 51 selfloop transitions, 7 changer transitions 28/87 dead transitions. [2022-12-06 06:37:42,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 87 transitions, 714 flow [2022-12-06 06:37:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:37:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:37:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 06:37:42,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5701754385964912 [2022-12-06 06:37:42,600 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 192 flow. Second operand 6 states and 65 transitions. [2022-12-06 06:37:42,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 87 transitions, 714 flow [2022-12-06 06:37:42,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 87 transitions, 708 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:42,604 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 234 flow [2022-12-06 06:37:42,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-06 06:37:42,605 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 06:37:42,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:42,605 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 234 flow [2022-12-06 06:37:42,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:42,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:42,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 234 flow [2022-12-06 06:37:42,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 234 flow [2022-12-06 06:37:42,632 INFO L130 PetriNetUnfolder]: 41/123 cut-off events. [2022-12-06 06:37:42,633 INFO L131 PetriNetUnfolder]: For 326/370 co-relation queries the response was YES. [2022-12-06 06:37:42,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 123 events. 41/123 cut-off events. For 326/370 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 479 event pairs, 10 based on Foata normal form. 8/126 useless extension candidates. Maximal degree in co-relation 502. Up to 60 conditions per place. [2022-12-06 06:37:42,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 234 flow [2022-12-06 06:37:42,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 06:37:42,658 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:42,659 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-06 06:37:42,659 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 234 flow [2022-12-06 06:37:42,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:42,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:42,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:42,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:37:42,659 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 06:37:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1381954807, now seen corresponding path program 1 times [2022-12-06 06:37:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105388344] [2022-12-06 06:37:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:42,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105388344] [2022-12-06 06:37:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105388344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:44,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:44,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:37:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680179139] [2022-12-06 06:37:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:37:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:37:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:37:44,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:37:44,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 234 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 06:37:44,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:44,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:37:44,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:44,658 INFO L130 PetriNetUnfolder]: 188/395 cut-off events. [2022-12-06 06:37:44,659 INFO L131 PetriNetUnfolder]: For 1130/1130 co-relation queries the response was YES. [2022-12-06 06:37:44,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 395 events. 188/395 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1697 event pairs, 35 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 1842. Up to 186 conditions per place. [2022-12-06 06:37:44,662 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 52 selfloop transitions, 12 changer transitions 13/77 dead transitions. [2022-12-06 06:37:44,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 704 flow [2022-12-06 06:37:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:37:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:37:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-06 06:37:44,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40601503759398494 [2022-12-06 06:37:44,665 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 234 flow. Second operand 7 states and 54 transitions. [2022-12-06 06:37:44,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 704 flow [2022-12-06 06:37:44,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 603 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-06 06:37:44,671 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 283 flow [2022-12-06 06:37:44,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-06 06:37:44,672 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2022-12-06 06:37:44,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:44,672 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 283 flow [2022-12-06 06:37:44,673 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:44,673 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:44,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 283 flow [2022-12-06 06:37:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 283 flow [2022-12-06 06:37:44,697 INFO L130 PetriNetUnfolder]: 42/132 cut-off events. [2022-12-06 06:37:44,697 INFO L131 PetriNetUnfolder]: For 264/278 co-relation queries the response was YES. [2022-12-06 06:37:44,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 132 events. 42/132 cut-off events. For 264/278 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 522 event pairs, 10 based on Foata normal form. 9/135 useless extension candidates. Maximal degree in co-relation 468. Up to 54 conditions per place. [2022-12-06 06:37:44,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 283 flow [2022-12-06 06:37:44,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 06:37:47,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L793: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= (store |v_#memory_int_655| |v_~#y~0.base_330| (store (select |v_#memory_int_655| |v_~#y~0.base_330|) |v_~#y~0.offset_330| 1)) |v_#memory_int_654|) (= v_~x~0_49 v_~__unbuffered_p1_EAX~0_91) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|)) InVars {~#y~0.offset=|v_~#y~0.offset_330|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, #memory_int=|v_#memory_int_655|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_330|, ~x~0=v_~x~0_49} OutVars{~#y~0.offset=|v_~#y~0.offset_330|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, #memory_int=|v_#memory_int_654|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_330|, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, #memory_int] and [699] $Ultimate##0-->L810: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= (store |v_#memory_int_327| |v_~#y~0.base_212| (store (select |v_#memory_int_327| |v_~#y~0.base_212|) |v_~#y~0.offset_212| 2)) |v_#memory_int_326|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~#y~0.offset=|v_~#y~0.offset_212|, #memory_int=|v_#memory_int_327|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~#y~0.base=|v_~#y~0.base_212|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, ~#y~0.offset=|v_~#y~0.offset_212|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, #memory_int=|v_#memory_int_326|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~#y~0.base=|v_~#y~0.base_212|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, #memory_int] [2022-12-06 06:37:48,076 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:37:48,077 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3405 [2022-12-06 06:37:48,078 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 297 flow [2022-12-06 06:37:48,078 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 06:37:48,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:48,078 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:48,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:37:48,078 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 06:37:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -623081154, now seen corresponding path program 1 times [2022-12-06 06:37:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223540674] [2022-12-06 06:37:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:48,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:48,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223540674] [2022-12-06 06:37:48,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223540674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:48,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:48,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632522532] [2022-12-06 06:37:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:48,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:37:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:37:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:37:48,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:37:48,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:48,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:48,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:37:48,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:48,425 INFO L130 PetriNetUnfolder]: 120/253 cut-off events. [2022-12-06 06:37:48,425 INFO L131 PetriNetUnfolder]: For 997/1002 co-relation queries the response was YES. [2022-12-06 06:37:48,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 253 events. 120/253 cut-off events. For 997/1002 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1016 event pairs, 13 based on Foata normal form. 20/272 useless extension candidates. Maximal degree in co-relation 1087. Up to 105 conditions per place. [2022-12-06 06:37:48,427 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 41 selfloop transitions, 10 changer transitions 22/73 dead transitions. [2022-12-06 06:37:48,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 726 flow [2022-12-06 06:37:48,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:37:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:37:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 06:37:48,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2022-12-06 06:37:48,430 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 297 flow. Second operand 7 states and 62 transitions. [2022-12-06 06:37:48,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 726 flow [2022-12-06 06:37:48,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 609 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-12-06 06:37:48,434 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 219 flow [2022-12-06 06:37:48,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2022-12-06 06:37:48,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-06 06:37:48,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:48,435 INFO L89 Accepts]: Start accepts. Operand has 54 places, 30 transitions, 219 flow [2022-12-06 06:37:48,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:48,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:48,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 30 transitions, 219 flow [2022-12-06 06:37:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 30 transitions, 219 flow [2022-12-06 06:37:48,447 INFO L130 PetriNetUnfolder]: 12/45 cut-off events. [2022-12-06 06:37:48,447 INFO L131 PetriNetUnfolder]: For 103/113 co-relation queries the response was YES. [2022-12-06 06:37:48,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 45 events. 12/45 cut-off events. For 103/113 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 3/47 useless extension candidates. Maximal degree in co-relation 154. Up to 16 conditions per place. [2022-12-06 06:37:48,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 30 transitions, 219 flow [2022-12-06 06:37:48,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 06:37:52,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L793: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= (store |v_#memory_int_655| |v_~#y~0.base_330| (store (select |v_#memory_int_655| |v_~#y~0.base_330|) |v_~#y~0.offset_330| 1)) |v_#memory_int_654|) (= v_~x~0_49 v_~__unbuffered_p1_EAX~0_91) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|)) InVars {~#y~0.offset=|v_~#y~0.offset_330|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, #memory_int=|v_#memory_int_655|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_330|, ~x~0=v_~x~0_49} OutVars{~#y~0.offset=|v_~#y~0.offset_330|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, #memory_int=|v_#memory_int_654|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~#y~0.base=|v_~#y~0.base_330|, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, #memory_int] and [759] L838-3-->L840-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1987~0#1.base_24| 0)) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_#memory_int_459| (store |v_#memory_int_460| |v_ULTIMATE.start_main_~#t1987~0#1.base_24| (store (select |v_#memory_int_460| |v_ULTIMATE.start_main_~#t1987~0#1.base_24|) |v_ULTIMATE.start_main_~#t1987~0#1.offset_24| |v_ULTIMATE.start_main_#t~pre29#1_35|))) (= (select |v_#valid_106| |v_ULTIMATE.start_main_~#t1987~0#1.base_24|) 0) (< |v_#StackHeapBarrier_47| |v_ULTIMATE.start_main_~#t1987~0#1.base_24|) (= (store |v_#valid_106| |v_ULTIMATE.start_main_~#t1987~0#1.base_24| 1) |v_#valid_105|) (= |v_ULTIMATE.start_main_~#t1987~0#1.offset_24| 0) (= |v_#pthreadsForks_59| |v_ULTIMATE.start_main_#t~pre29#1_35|) (= (store |v_#length_97| |v_ULTIMATE.start_main_~#t1987~0#1.base_24| 4) |v_#length_96|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_47|, #pthreadsForks=|v_#pthreadsForks_59|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_460|, #length=|v_#length_97|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_47|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_35|, ULTIMATE.start_main_~#t1987~0#1.base=|v_ULTIMATE.start_main_~#t1987~0#1.base_24|, ULTIMATE.start_main_~#t1987~0#1.offset=|v_ULTIMATE.start_main_~#t1987~0#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_58|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_459|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_33|, #length=|v_#length_96|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t1987~0#1.base, ULTIMATE.start_main_~#t1987~0#1.offset, #pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 06:38:15,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->L840-2: Formula: (and (= |v_#pthreadsForks_70| (+ |v_#pthreadsForks_71| 1)) (= |v_#pthreadsForks_71| |v_ULTIMATE.start_main_#t~pre29#1_61|) (= (select |v_#valid_118| |v_ULTIMATE.start_main_~#t1987~0#1.base_28|) 0) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= |v_ULTIMATE.start_main_~#t1987~0#1.offset_28| 0) (not (= |v_ULTIMATE.start_main_~#t1987~0#1.base_28| 0)) (= (store |v_#length_109| |v_ULTIMATE.start_main_~#t1987~0#1.base_28| 4) |v_#length_108|) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= (let ((.cse0 (store |v_#memory_int_714| |v_~#y~0.base_350| (store (select |v_#memory_int_714| |v_~#y~0.base_350|) |v_~#y~0.offset_350| 1)))) (store .cse0 |v_ULTIMATE.start_main_~#t1987~0#1.base_28| (store (select .cse0 |v_ULTIMATE.start_main_~#t1987~0#1.base_28|) |v_ULTIMATE.start_main_~#t1987~0#1.offset_28| |v_ULTIMATE.start_main_#t~pre29#1_61|))) |v_#memory_int_712|) (= v_~x~0_57 v_~__unbuffered_p1_EAX~0_103) (< |v_#StackHeapBarrier_53| |v_ULTIMATE.start_main_~#t1987~0#1.base_28|) (= |v_#valid_117| (store |v_#valid_118| |v_ULTIMATE.start_main_~#t1987~0#1.base_28| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_53|, ~#y~0.offset=|v_~#y~0.offset_350|, #pthreadsForks=|v_#pthreadsForks_71|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, #valid=|v_#valid_118|, #memory_int=|v_#memory_int_714|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, #length=|v_#length_109|, ~#y~0.base=|v_~#y~0.base_350|, ~x~0=v_~x~0_57} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_61|, ULTIMATE.start_main_~#t1987~0#1.offset=|v_ULTIMATE.start_main_~#t1987~0#1.offset_28|, ~#y~0.offset=|v_~#y~0.offset_350|, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, ~#y~0.base=|v_~#y~0.base_350|, #StackHeapBarrier=|v_#StackHeapBarrier_53|, ULTIMATE.start_main_~#t1987~0#1.base=|v_ULTIMATE.start_main_~#t1987~0#1.base_28|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, #pthreadsForks=|v_#pthreadsForks_70|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_712|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_39|, #length=|v_#length_108|, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_~#t1987~0#1.offset, ULTIMATE.start_main_~#t1987~0#1.base, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, #pthreadsForks, ~__unbuffered_p1_EAX~0, #valid, #memory_int, ULTIMATE.start_main_#t~pre27#1, #length, ULTIMATE.start_main_#t~nondet28#1] and [653] L793-->L801: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_36 256) 0))) (let ((.cse8 (not .cse1)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse3 (= (mod v_~y$w_buff1_used~0_190 256) 0)) (.cse4 (= (mod v_~y$r_buff1_thd2~0_34 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse0 (select |v_#memory_int_233| |v_~#y~0.base_170|)) (.cse9 (not .cse2)) (.cse6 (not .cse4)) (.cse7 (not .cse3)) (.cse11 (and .cse8 .cse10))) (and (= (store |v_#memory_int_233| |v_~#y~0.base_170| (store .cse0 |v_~#y~0.offset_170| |v_P1_#t~ite21_25|)) |v_#memory_int_232|) (let ((.cse5 (= |v_P1Thread1of1ForFork0_#t~mem19_1| |v_P1_#t~mem19_32|))) (or (and (= |v_P1_#t~ite20_29| |v_P1_#t~ite21_25|) (or .cse1 .cse2) (or (and (= |v_P1_#t~ite20_29| |v_P1_#t~mem19_32|) (or .cse3 .cse4) (= (select .cse0 |v_~#y~0.offset_170|) |v_P1_#t~mem19_32|)) (and .cse5 (= |v_P1_#t~ite20_29| v_~y$w_buff1~0_90) .cse6 .cse7))) (and .cse5 .cse8 (= |v_P1_#t~ite21_25| v_~y$w_buff0~0_84) .cse9 (= |v_P1_#t~ite20_29| |v_P1Thread1of1ForFork0_#t~ite20_1|)))) (= v_~y$w_buff0_used~0_200 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_201)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_35 256) 0)) .cse10) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse6)) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_35 (ite .cse11 0 v_~y$r_buff0_thd2~0_36)) (= (ite (or (and .cse6 .cse7) .cse11) 0 v_~y$w_buff1_used~0_190) v_~y$w_buff1_used~0_189))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, #memory_int=|v_#memory_int_233|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_1|, ~#y~0.base=|v_~#y~0.base_170|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, #memory_int=|v_#memory_int_232|, ~#y~0.base=|v_~#y~0.base_170|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P1_#t~mem19_32|, |v_P1_#t~ite20_29|, |v_P1_#t~ite21_25|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~y$w_buff1_used~0] [2022-12-06 06:38:19,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] $Ultimate##0-->L810: Formula: (and (= (store |v_#memory_int_678| |v_~#y~0.base_338| (store (select |v_#memory_int_678| |v_~#y~0.base_338|) |v_~#y~0.offset_338| 2)) |v_#memory_int_676|) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_~x~0_53 v_~__unbuffered_p1_EAX~0_97) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, ~#y~0.offset=|v_~#y~0.offset_338|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, #memory_int=|v_#memory_int_678|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~#y~0.base=|v_~#y~0.base_338|, ~x~0=v_~x~0_53} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, ~#y~0.offset=|v_~#y~0.offset_338|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, ~#y~0.base=|v_~#y~0.base_338|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, #memory_int=|v_#memory_int_676|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork1_~arg.base, #memory_int] and [774] L840-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$w_buff0_used~0_583 256) 0)) (.cse17 (= (mod v_~y$r_buff0_thd0~0_272 256) 0))) (let ((.cse10 (not .cse17)) (.cse12 (not .cse18))) (let ((.cse1 (ite (and .cse10 .cse12) 0 v_~y$w_buff0_used~0_583))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse30 (not .cse4))) (let ((.cse31 (and .cse30 .cse10))) (let ((.cse16 (= (mod v_~y$r_buff1_thd0~0_277 256) 0)) (.cse15 (= 0 (mod v_~y$w_buff1_used~0_570 256))) (.cse19 (ite .cse31 0 v_~y$r_buff0_thd0~0_272))) (let ((.cse20 (= (mod .cse19 256) 0)) (.cse13 (not .cse15)) (.cse14 (not .cse16))) (let ((.cse28 (ite (or .cse31 (and .cse13 .cse14)) 0 v_~y$w_buff1_used~0_570)) (.cse23 (not .cse20))) (let ((.cse5 (and .cse23 .cse30)) (.cse29 (= (mod .cse28 256) 0))) (let ((.cse25 (ite (or .cse5 (and (not .cse29) .cse14)) 0 v_~y$r_buff1_thd0~0_277))) (let ((.cse27 (= (mod .cse25 256) 0)) (.cse24 (= (mod v_~weak$$choice2~0_196 256) 0))) (let ((.cse7 (select |v_#memory_int_723| |v_~#y~0.base_354|)) (.cse21 (= (mod v_~y$w_buff1_used~0_569 256) 0)) (.cse0 (not .cse24)) (.cse2 (and .cse29 .cse20)) (.cse3 (and .cse20 .cse27)) (.cse22 (= (mod v_~y$w_buff0_used~0_582 256) 0))) (and (= (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 (ite .cse5 0 .cse1))) v_~y$w_buff0_used~0_582) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem40#1_226| |v_ULTIMATE.start_main_#t~mem40#1_224|)) (.cse6 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256)))) (or (and (not .cse6) (let ((.cse8 (= (mod v_~weak$$choice1~0_186 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_221| |v_ULTIMATE.start_main_#t~mem40#1_224|) (= |v_ULTIMATE.start_main_#t~mem40#1_224| (select (select (store |v_#memory_int_723| |v_~#y~0.base_354| (store .cse7 |v_~#y~0.offset_354| v_~y$mem_tmp~0_168)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147)) (not .cse8)) (and .cse9 .cse8 (= |v_ULTIMATE.start_main_#t~ite41#1_221| v_~__unbuffered_p0_EAX~0_207)))) (= |v_ULTIMATE.start_main_#t~ite41#1_221| v_~__unbuffered_p0_EAX~0_206)) (and .cse9 .cse6 (= v_~__unbuffered_p0_EAX~0_207 v_~__unbuffered_p0_EAX~0_206) (= |v_ULTIMATE.start_main_#t~ite41#1_221| |v_ULTIMATE.start_main_#t~ite41#1_223|)))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem31#1_168| |v_ULTIMATE.start_main_#t~mem31#1_166|))) (or (and .cse10 .cse11 .cse12 (= |v_ULTIMATE.start_main_#t~ite32#1_165| |v_ULTIMATE.start_main_#t~ite32#1_163|) (= v_~y$mem_tmp~0_168 v_~y$w_buff0~0_369)) (and (or (and .cse13 .cse11 .cse14 (= v_~y$w_buff1~0_371 |v_ULTIMATE.start_main_#t~ite32#1_163|)) (and (or .cse15 .cse16) (= (select .cse7 |v_~#y~0.offset_354|) |v_ULTIMATE.start_main_#t~mem31#1_166|) (= |v_ULTIMATE.start_main_#t~mem31#1_166| |v_ULTIMATE.start_main_#t~ite32#1_163|))) (or .cse17 .cse18) (= v_~y$mem_tmp~0_168 |v_ULTIMATE.start_main_#t~ite32#1_163|)))) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_206) (= v_~__unbuffered_p1_EAX~0_105 1) (= v_~y$mem_tmp~0_168 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_78) (= v_~y$w_buff0~0_369 v_~y$w_buff0~0_368) (= (store |v_#memory_int_723| |v_~#y~0.base_354| (store .cse7 |v_~#y~0.offset_354| |v_ULTIMATE.start_main_#t~ite45#1_154|)) |v_#memory_int_722|) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~main$tmp_guard0~0_70 (ite (= (ite (= v_~__unbuffered_cnt~0_203 3) 1 0) 0) 0 1)) (= v_~weak$$choice0~0_196 |v_ULTIMATE.start_main_#t~nondet34#1_141|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71| (mod v_~main$tmp_guard0~0_70 256)) (= |v_ULTIMATE.start_main_#t~nondet35#1_143| v_~weak$$choice2~0_196) (= v_~y$r_buff0_thd0~0_271 (ite .cse0 .cse19 (ite (or (and .cse20 .cse21) .cse3 .cse22) .cse19 (ite (and .cse23 (not .cse22)) 0 .cse19)))) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_154| v_~y$mem_tmp~0_168) (= |v_ULTIMATE.start_main_#t~mem44#1_208| |v_ULTIMATE.start_main_#t~mem44#1_206|) .cse0) (and (= v_~y$mem_tmp~0_168 |v_ULTIMATE.start_main_#t~mem44#1_206|) .cse24 (= |v_ULTIMATE.start_main_#t~ite45#1_154| |v_ULTIMATE.start_main_#t~mem44#1_206|))) (= v_~y$r_buff1_thd0~0_276 (ite .cse0 .cse25 (ite (let ((.cse26 (= (mod v_~y$r_buff0_thd0~0_271 256) 0))) (or (and .cse21 .cse26) (and .cse26 .cse27) .cse22)) .cse25 0))) (= v_~weak$$choice1~0_186 |v_ULTIMATE.start_main_#t~nondet39#1_145|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= v_~y$flush_delayed~0_188 0) (= v_~y$w_buff1~0_371 v_~y$w_buff1~0_370) (= (ite .cse0 .cse28 (ite (or .cse2 .cse3 .cse22) .cse28 0)) v_~y$w_buff1_used~0_569))))))))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_145|, ~#y~0.offset=|v_~#y~0.offset_354|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_583, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_226|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_141|, ~#y~0.base=|v_~#y~0.base_354|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_208|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_207, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_223|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_371, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_168|, ~y$w_buff0~0=v_~y$w_buff0~0_369, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_272, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_143|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_165|, #memory_int=|v_#memory_int_723|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_203, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_277, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_570} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~#y~0.offset=|v_~#y~0.offset_354|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_582, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_153|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_85|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~#y~0.base=|v_~#y~0.base_354|, ~y$mem_tmp~0=v_~y$mem_tmp~0_168, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_206, ~weak$$choice1~0=v_~weak$$choice1~0_186, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_105, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_65|, ~y$w_buff0~0=v_~y$w_buff0~0_368, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~y$flush_delayed~0=v_~y$flush_delayed~0_188, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_90|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_70, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_81|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_147, ~weak$$choice0~0=v_~weak$$choice0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff1~0=v_~y$w_buff1~0_370, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_271, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_136|, #memory_int=|v_#memory_int_722|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_147, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_170|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_203, ~weak$$choice2~0=v_~weak$$choice2~0_196, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_276, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_215|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_569, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_221|, |v_ULTIMATE.start_main_#t~mem40#1_224|, |v_ULTIMATE.start_main_#t~mem44#1_206|, |v_ULTIMATE.start_main_#t~mem31#1_166|, |v_ULTIMATE.start_main_#t~ite32#1_163|, |v_ULTIMATE.start_main_#t~ite45#1_154|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~mem40#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~ite38#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:38:22,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [776] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~y$r_buff0_thd0~0_276 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_591 256) 0))) (let ((.cse13 (not .cse16)) (.cse14 (not .cse15))) (let ((.cse5 (ite (and .cse13 .cse14) 0 v_~y$w_buff0_used~0_591))) (let ((.cse6 (= (mod .cse5 256) 0))) (let ((.cse30 (not .cse6))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse21 (ite .cse31 0 v_~y$r_buff0_thd0~0_276)) (.cse19 (= (mod v_~y$r_buff1_thd0~0_281 256) 0)) (.cse20 (= (mod v_~y$w_buff1_used~0_578 256) 0))) (let ((.cse17 (not .cse20)) (.cse18 (not .cse19)) (.cse22 (= (mod .cse21 256) 0))) (let ((.cse23 (not .cse22)) (.cse1 (ite (or .cse31 (and .cse17 .cse18)) 0 v_~y$w_buff1_used~0_578))) (let ((.cse29 (= (mod .cse1 256) 0)) (.cse7 (and .cse30 .cse23))) (let ((.cse8 (ite (or (and (not .cse29) .cse18) .cse7) 0 v_~y$r_buff1_thd0~0_281))) (let ((.cse24 (= (mod v_~weak$$choice2~0_198 256) 0)) (.cse11 (= (mod .cse8 256) 0))) (let ((.cse4 (and .cse22 .cse29)) (.cse10 (= 0 (mod v_~y$w_buff1_used~0_577 256))) (.cse3 (and .cse11 .cse22)) (.cse2 (= (mod v_~y$w_buff0_used~0_590 256) 0)) (.cse0 (not .cse24)) (.cse25 (select |v_#memory_int_734| |v_~#y~0.base_358|))) (and (= |v_ULTIMATE.start_main_#t~nondet35#1_147| v_~weak$$choice2~0_198) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_205 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_72) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= v_~y$w_buff0~0_375 v_~y$w_buff0~0_374) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= v_~weak$$choice1~0_188 |v_ULTIMATE.start_main_#t~nondet39#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 0)) v_~y$w_buff1_used~0_577) (= v_~y$w_buff0_used~0_590 (ite .cse0 .cse5 (ite (or .cse6 .cse3 .cse4) .cse5 (ite .cse7 0 .cse5)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|) (= v_~y$r_buff1_thd0~0_280 (ite .cse0 .cse8 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd0~0_275 256) 0))) (or (and .cse9 .cse10) (and .cse11 .cse9) .cse2)) .cse8 0))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~y$mem_tmp~0_170 2) (= 2 v_~__unbuffered_p0_EAX~0_210) (= v_~__unbuffered_p1_EAX~0_109 1))) 1 0) 0) 0 1)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_27| v_P1Thread1of1ForFork0_~arg.offset_27) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| (mod v_~main$tmp_guard1~0_80 256)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem31#1_175| |v_ULTIMATE.start_main_#t~mem31#1_173|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32#1_172| |v_ULTIMATE.start_main_#t~ite32#1_170|) .cse12 .cse13 (= v_~y$mem_tmp~0_170 v_~y$w_buff0~0_375) .cse14) (and (or .cse15 .cse16) (or (and .cse17 .cse18 .cse12 (= v_~y$w_buff1~0_377 |v_ULTIMATE.start_main_#t~ite32#1_170|)) (and (or .cse19 .cse20) (= |v_ULTIMATE.start_main_#t~mem31#1_173| |v_ULTIMATE.start_main_#t~ite32#1_170|))) (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~ite32#1_170|)))) (= v_~y$r_buff0_thd0~0_275 (ite .cse0 .cse21 (ite (or (and .cse22 .cse10) .cse2 .cse3) .cse21 (ite (and (not .cse2) .cse23) 0 .cse21)))) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (or (and .cse24 (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~mem44#1_213|) (= |v_ULTIMATE.start_main_#t~ite45#1_159| |v_ULTIMATE.start_main_#t~mem44#1_213|)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_159| v_~y$mem_tmp~0_170) (= |v_ULTIMATE.start_main_#t~mem44#1_215| |v_ULTIMATE.start_main_#t~mem44#1_213|) .cse0)) (= v_~y$flush_delayed~0_190 0) (= v_~x~0_63 v_~__unbuffered_p1_EAX~0_109) (= (store |v_#memory_int_734| |v_~#y~0.base_358| (store .cse25 |v_~#y~0.offset_358| |v_ULTIMATE.start_main_#t~ite45#1_159|)) |v_#memory_int_732|) (let ((.cse27 (= |v_ULTIMATE.start_main_#t~mem40#1_233| |v_ULTIMATE.start_main_#t~mem40#1_231|)) (.cse28 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_146 256) 0))) (or (and (let ((.cse26 (= (mod v_~weak$$choice1~0_188 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_228| |v_ULTIMATE.start_main_#t~mem40#1_231|) (not .cse26) (= (select (select (store |v_#memory_int_734| |v_~#y~0.base_358| (store .cse25 |v_~#y~0.offset_358| v_~y$mem_tmp~0_170)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149) |v_ULTIMATE.start_main_#t~mem40#1_231|)) (and .cse27 .cse26 (= |v_ULTIMATE.start_main_#t~ite41#1_228| v_~__unbuffered_p0_EAX~0_211)))) (= |v_ULTIMATE.start_main_#t~ite41#1_228| v_~__unbuffered_p0_EAX~0_210) (not .cse28)) (and (= v_~__unbuffered_p0_EAX~0_211 v_~__unbuffered_p0_EAX~0_210) .cse27 .cse28 (= |v_ULTIMATE.start_main_#t~ite41#1_228| |v_ULTIMATE.start_main_#t~ite41#1_230|)))) (= v_~weak$$choice0~0_198 |v_ULTIMATE.start_main_#t~nondet34#1_145|) (= v_~y$w_buff1~0_377 v_~y$w_buff1~0_376) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_P1Thread1of1ForFork0_~arg.base_27 |v_P1Thread1of1ForFork0_#in~arg.base_27|))))))))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_149|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_591, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_145|, ~#y~0.base=|v_~#y~0.base_358|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_211, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_230|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_175|, ~y$w_buff0~0=v_~y$w_buff0~0_375, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_147|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_172|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_233|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ~y$w_buff1~0=v_~y$w_buff1~0_377, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_276, #memory_int=|v_#memory_int_734|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_205, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_578} OutVars{ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_158|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_87|, ~y$mem_tmp~0=v_~y$mem_tmp~0_170, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_210, ~weak$$choice1~0=v_~weak$$choice1~0_188, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_109, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_67|, ~y$flush_delayed~0=v_~y$flush_delayed~0_190, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_83|, ~weak$$choice0~0=v_~weak$$choice0~0_198, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff1~0=v_~y$w_buff1~0_376, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_172|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_205, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_280, ~x~0=v_~x~0_63, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_217|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_590, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~#y~0.base=|v_~#y~0.base_358|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~y$w_buff0~0=v_~y$w_buff0~0_374, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_67|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_27, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_138|, #memory_int=|v_#memory_int_732|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ~weak$$choice2~0=v_~weak$$choice2~0_198, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_577, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[|v_ULTIMATE.start_main_#t~mem31#1_173|, |v_ULTIMATE.start_main_#t~ite32#1_170|, |v_ULTIMATE.start_main_#t~ite45#1_159|, |v_ULTIMATE.start_main_#t~mem40#1_231|, |v_ULTIMATE.start_main_#t~mem44#1_213|, |v_ULTIMATE.start_main_#t~ite41#1_228|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~nondet30#1, P2Thread1of1ForFork1_~arg.base, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~pre29#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~mem40#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite38#1, #memory_int, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [653] L793-->L801: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_36 256) 0))) (let ((.cse8 (not .cse1)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse3 (= (mod v_~y$w_buff1_used~0_190 256) 0)) (.cse4 (= (mod v_~y$r_buff1_thd2~0_34 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse0 (select |v_#memory_int_233| |v_~#y~0.base_170|)) (.cse9 (not .cse2)) (.cse6 (not .cse4)) (.cse7 (not .cse3)) (.cse11 (and .cse8 .cse10))) (and (= (store |v_#memory_int_233| |v_~#y~0.base_170| (store .cse0 |v_~#y~0.offset_170| |v_P1_#t~ite21_25|)) |v_#memory_int_232|) (let ((.cse5 (= |v_P1Thread1of1ForFork0_#t~mem19_1| |v_P1_#t~mem19_32|))) (or (and (= |v_P1_#t~ite20_29| |v_P1_#t~ite21_25|) (or .cse1 .cse2) (or (and (= |v_P1_#t~ite20_29| |v_P1_#t~mem19_32|) (or .cse3 .cse4) (= (select .cse0 |v_~#y~0.offset_170|) |v_P1_#t~mem19_32|)) (and .cse5 (= |v_P1_#t~ite20_29| v_~y$w_buff1~0_90) .cse6 .cse7))) (and .cse5 .cse8 (= |v_P1_#t~ite21_25| v_~y$w_buff0~0_84) .cse9 (= |v_P1_#t~ite20_29| |v_P1Thread1of1ForFork0_#t~ite20_1|)))) (= v_~y$w_buff0_used~0_200 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_201)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_35 256) 0)) .cse10) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse6)) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_35 (ite .cse11 0 v_~y$r_buff0_thd2~0_36)) (= (ite (or (and .cse6 .cse7) .cse11) 0 v_~y$w_buff1_used~0_190) v_~y$w_buff1_used~0_189))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, #memory_int=|v_#memory_int_233|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_1|, ~#y~0.base=|v_~#y~0.base_170|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~#y~0.offset=|v_~#y~0.offset_170|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0~0=v_~y$w_buff0~0_84, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_35, #memory_int=|v_#memory_int_232|, ~#y~0.base=|v_~#y~0.base_170|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P1_#t~mem19_32|, |v_P1_#t~ite20_29|, |v_P1_#t~ite21_25|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~y$w_buff1_used~0] [2022-12-06 06:38:24,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [776] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~y$r_buff0_thd0~0_276 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_591 256) 0))) (let ((.cse13 (not .cse16)) (.cse14 (not .cse15))) (let ((.cse5 (ite (and .cse13 .cse14) 0 v_~y$w_buff0_used~0_591))) (let ((.cse6 (= (mod .cse5 256) 0))) (let ((.cse30 (not .cse6))) (let ((.cse31 (and .cse30 .cse14))) (let ((.cse21 (ite .cse31 0 v_~y$r_buff0_thd0~0_276)) (.cse19 (= (mod v_~y$r_buff1_thd0~0_281 256) 0)) (.cse20 (= (mod v_~y$w_buff1_used~0_578 256) 0))) (let ((.cse17 (not .cse20)) (.cse18 (not .cse19)) (.cse22 (= (mod .cse21 256) 0))) (let ((.cse23 (not .cse22)) (.cse1 (ite (or .cse31 (and .cse17 .cse18)) 0 v_~y$w_buff1_used~0_578))) (let ((.cse29 (= (mod .cse1 256) 0)) (.cse7 (and .cse30 .cse23))) (let ((.cse8 (ite (or (and (not .cse29) .cse18) .cse7) 0 v_~y$r_buff1_thd0~0_281))) (let ((.cse24 (= (mod v_~weak$$choice2~0_198 256) 0)) (.cse11 (= (mod .cse8 256) 0))) (let ((.cse4 (and .cse22 .cse29)) (.cse10 (= 0 (mod v_~y$w_buff1_used~0_577 256))) (.cse3 (and .cse11 .cse22)) (.cse2 (= (mod v_~y$w_buff0_used~0_590 256) 0)) (.cse0 (not .cse24)) (.cse25 (select |v_#memory_int_734| |v_~#y~0.base_358|))) (and (= |v_ULTIMATE.start_main_#t~nondet35#1_147| v_~weak$$choice2~0_198) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_205 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_72) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= v_~y$w_buff0~0_375 v_~y$w_buff0~0_374) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= v_~weak$$choice1~0_188 |v_ULTIMATE.start_main_#t~nondet39#1_149|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 0)) v_~y$w_buff1_used~0_577) (= v_~y$w_buff0_used~0_590 (ite .cse0 .cse5 (ite (or .cse6 .cse3 .cse4) .cse5 (ite .cse7 0 .cse5)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|) (= v_~y$r_buff1_thd0~0_280 (ite .cse0 .cse8 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd0~0_275 256) 0))) (or (and .cse9 .cse10) (and .cse11 .cse9) .cse2)) .cse8 0))) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~y$mem_tmp~0_170 2) (= 2 v_~__unbuffered_p0_EAX~0_210) (= v_~__unbuffered_p1_EAX~0_109 1))) 1 0) 0) 0 1)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_27| v_P1Thread1of1ForFork0_~arg.offset_27) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| (mod v_~main$tmp_guard1~0_80 256)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem31#1_175| |v_ULTIMATE.start_main_#t~mem31#1_173|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32#1_172| |v_ULTIMATE.start_main_#t~ite32#1_170|) .cse12 .cse13 (= v_~y$mem_tmp~0_170 v_~y$w_buff0~0_375) .cse14) (and (or .cse15 .cse16) (or (and .cse17 .cse18 .cse12 (= v_~y$w_buff1~0_377 |v_ULTIMATE.start_main_#t~ite32#1_170|)) (and (or .cse19 .cse20) (= |v_ULTIMATE.start_main_#t~mem31#1_173| |v_ULTIMATE.start_main_#t~ite32#1_170|))) (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~ite32#1_170|)))) (= v_~y$r_buff0_thd0~0_275 (ite .cse0 .cse21 (ite (or (and .cse22 .cse10) .cse2 .cse3) .cse21 (ite (and (not .cse2) .cse23) 0 .cse21)))) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (or (and .cse24 (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~mem44#1_213|) (= |v_ULTIMATE.start_main_#t~ite45#1_159| |v_ULTIMATE.start_main_#t~mem44#1_213|)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_159| v_~y$mem_tmp~0_170) (= |v_ULTIMATE.start_main_#t~mem44#1_215| |v_ULTIMATE.start_main_#t~mem44#1_213|) .cse0)) (= v_~y$flush_delayed~0_190 0) (= v_~x~0_63 v_~__unbuffered_p1_EAX~0_109) (= (store |v_#memory_int_734| |v_~#y~0.base_358| (store .cse25 |v_~#y~0.offset_358| |v_ULTIMATE.start_main_#t~ite45#1_159|)) |v_#memory_int_732|) (let ((.cse27 (= |v_ULTIMATE.start_main_#t~mem40#1_233| |v_ULTIMATE.start_main_#t~mem40#1_231|)) (.cse28 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_146 256) 0))) (or (and (let ((.cse26 (= (mod v_~weak$$choice1~0_188 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_228| |v_ULTIMATE.start_main_#t~mem40#1_231|) (not .cse26) (= (select (select (store |v_#memory_int_734| |v_~#y~0.base_358| (store .cse25 |v_~#y~0.offset_358| v_~y$mem_tmp~0_170)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149) |v_ULTIMATE.start_main_#t~mem40#1_231|)) (and .cse27 .cse26 (= |v_ULTIMATE.start_main_#t~ite41#1_228| v_~__unbuffered_p0_EAX~0_211)))) (= |v_ULTIMATE.start_main_#t~ite41#1_228| v_~__unbuffered_p0_EAX~0_210) (not .cse28)) (and (= v_~__unbuffered_p0_EAX~0_211 v_~__unbuffered_p0_EAX~0_210) .cse27 .cse28 (= |v_ULTIMATE.start_main_#t~ite41#1_228| |v_ULTIMATE.start_main_#t~ite41#1_230|)))) (= v_~weak$$choice0~0_198 |v_ULTIMATE.start_main_#t~nondet34#1_145|) (= v_~y$w_buff1~0_377 v_~y$w_buff1~0_376) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_P1Thread1of1ForFork0_~arg.base_27 |v_P1Thread1of1ForFork0_#in~arg.base_27|))))))))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_149|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_591, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_145|, ~#y~0.base=|v_~#y~0.base_358|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_211, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_230|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_175|, ~y$w_buff0~0=v_~y$w_buff0~0_375, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_147|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_172|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_233|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ~y$w_buff1~0=v_~y$w_buff1~0_377, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_276, #memory_int=|v_#memory_int_734|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_205, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_578} OutVars{ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_158|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_87|, ~y$mem_tmp~0=v_~y$mem_tmp~0_170, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_210, ~weak$$choice1~0=v_~weak$$choice1~0_188, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_109, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_67|, ~y$flush_delayed~0=v_~y$flush_delayed~0_190, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_92|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_83|, ~weak$$choice0~0=v_~weak$$choice0~0_198, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff1~0=v_~y$w_buff1~0_376, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_172|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_205, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_280, ~x~0=v_~x~0_63, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_217|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_590, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~#y~0.base=|v_~#y~0.base_358|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~y$w_buff0~0=v_~y$w_buff0~0_374, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_27|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_146, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_67|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_27, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_138|, #memory_int=|v_#memory_int_732|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ~weak$$choice2~0=v_~weak$$choice2~0_198, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_577, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[|v_ULTIMATE.start_main_#t~mem31#1_173|, |v_ULTIMATE.start_main_#t~ite32#1_170|, |v_ULTIMATE.start_main_#t~ite45#1_159|, |v_ULTIMATE.start_main_#t~mem40#1_231|, |v_ULTIMATE.start_main_#t~mem44#1_213|, |v_ULTIMATE.start_main_#t~ite41#1_228|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~nondet30#1, P2Thread1of1ForFork1_~arg.base, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~pre29#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~mem40#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem36#1, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite38#1, #memory_int, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [659] L810-->L818: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_212 256) 0))) (.cse2 (= (mod v_~y$r_buff1_thd3~0_30 256) 0)) (.cse1 (= 0 (mod v_~y$w_buff1_used~0_202 256))) (.cse7 (= (mod v_~y$w_buff0_used~0_213 256) 0))) (let ((.cse0 (select |v_#memory_int_245| |v_~#y~0.base_176|)) (.cse9 (not .cse7)) (.cse4 (not .cse1)) (.cse5 (not .cse2)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse3 (= |v_P2_#t~mem22_34| |v_P2Thread1of1ForFork1_#t~mem22_1|))) (or (and (or (and (= |v_P2_#t~mem22_34| (select .cse0 |v_~#y~0.offset_176|)) (or .cse1 .cse2) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_34|)) (and .cse3 (= v_~y$w_buff1~0_100 |v_P2_#t~ite23_25|) .cse4 .cse5)) (or .cse6 .cse7) (= |v_P2_#t~ite24_29| |v_P2_#t~ite23_25|)) (and .cse8 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork1_#t~ite23_1|) (= |v_P2_#t~ite24_29| v_~y$w_buff0~0_94) .cse9))) (= (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_201 256) 0)) .cse5)) 0 v_~y$r_buff1_thd3~0_30) v_~y$r_buff1_thd3~0_29) (= (store |v_#memory_int_245| |v_~#y~0.base_176| (store .cse0 |v_~#y~0.offset_176| |v_P2_#t~ite24_29|)) |v_#memory_int_244|) (= (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_213) v_~y$w_buff0_used~0_212) (= v_~y$w_buff1_used~0_201 (ite (or .cse11 (and .cse4 .cse5)) 0 v_~y$w_buff1_used~0_202)) (= (ite .cse11 0 v_~y$r_buff0_thd3~0_30) v_~y$r_buff0_thd3~0_29))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_30, ~#y~0.offset=|v_~#y~0.offset_176|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_213, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_94, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_1|, #memory_int=|v_#memory_int_245|, P2Thread1of1ForFork1_#t~mem22=|v_P2Thread1of1ForFork1_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_176|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_202} OutVars{P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_29, ~#y~0.offset=|v_~#y~0.offset_176|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_244|, ~#y~0.base=|v_~#y~0.base_176|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_201} AuxVars[|v_P2_#t~ite23_25|, |v_P2_#t~ite24_29|, |v_P2_#t~mem22_34|] AssignedVars[P2Thread1of1ForFork1_#t~ite24, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite23, #memory_int, P2Thread1of1ForFork1_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:38:27,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L801: Formula: (let ((.cse13 (= (mod v_~y$r_buff0_thd0~0_280 256) 0)) (.cse14 (= (mod v_~y$w_buff0_used~0_596 256) 0))) (let ((.cse15 (not .cse14)) (.cse16 (not .cse13))) (let ((.cse37 (ite (and .cse15 .cse16) 0 v_~y$w_buff0_used~0_596))) (let ((.cse38 (= (mod .cse37 256) 0))) (let ((.cse41 (not .cse38))) (let ((.cse42 (and .cse41 .cse16))) (let ((.cse8 (= (mod v_~y$w_buff1_used~0_583 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd0~0_285 256) 0)) (.cse29 (ite .cse42 0 v_~y$r_buff0_thd0~0_280))) (let ((.cse31 (= (mod .cse29 256) 0)) (.cse10 (not .cse9)) (.cse12 (not .cse8))) (let ((.cse35 (ite (or .cse42 (and .cse10 .cse12)) 0 v_~y$w_buff1_used~0_583)) (.cse32 (not .cse31))) (let ((.cse39 (and .cse41 .cse32)) (.cse40 (= (mod .cse35 256) 0))) (let ((.cse18 (ite (or .cse39 (and .cse10 (not .cse40))) 0 v_~y$r_buff1_thd0~0_285))) (let ((.cse20 (= (mod .cse18 256) 0)) (.cse34 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse17 (not .cse34)) (.cse36 (and .cse40 .cse31)) (.cse30 (and .cse31 .cse20))) (let ((.cse25 (ite .cse17 .cse37 (ite (or .cse38 .cse36 .cse30) .cse37 (ite .cse39 0 .cse37))))) (let ((.cse21 (= (mod .cse25 256) 0))) (let ((.cse27 (= (mod v_~y$r_buff0_thd2~0_104 256) 0)) (.cse7 (ite .cse17 .cse35 (ite (or .cse36 .cse30 .cse21) .cse35 0)))) (let ((.cse28 (= (mod v_~y$r_buff1_thd2~0_106 256) 0)) (.cse22 (= (mod .cse7 256) 0)) (.cse33 (not (= (mod v_~y$w_buff0_used~0_594 256) 0))) (.cse24 (not .cse27))) (let ((.cse6 (and .cse33 .cse24)) (.cse3 (select |v_#memory_int_740| |v_~#y~0.base_360|)) (.cse5 (not .cse22)) (.cse23 (not .cse21)) (.cse4 (not .cse28))) (and (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem40#1_239| |v_ULTIMATE.start_main_#t~mem40#1_237|)) (.cse1 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_148 256)))) (or (and (= v_~__unbuffered_p0_EAX~0_215 v_~__unbuffered_p0_EAX~0_214) (= |v_ULTIMATE.start_main_#t~ite41#1_236| |v_ULTIMATE.start_main_#t~ite41#1_234|) .cse0 .cse1) (and (let ((.cse2 (= (mod v_~weak$$choice1~0_190 256) 0))) (or (and (not .cse2) (= (select (select (store |v_#memory_int_740| |v_~#y~0.base_360| (store .cse3 |v_~#y~0.offset_360| v_~y$mem_tmp~0_172)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_151) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_151) |v_ULTIMATE.start_main_#t~mem40#1_237|) (= |v_ULTIMATE.start_main_#t~ite41#1_234| |v_ULTIMATE.start_main_#t~mem40#1_237|)) (and (= |v_ULTIMATE.start_main_#t~ite41#1_234| v_~__unbuffered_p0_EAX~0_215) .cse2 .cse0))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_234| v_~__unbuffered_p0_EAX~0_214)))) (= v_~x~0_65 v_~__unbuffered_p1_EAX~0_111) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_main_#t~nondet35#1_151| v_~weak$$choice2~0_200) (= v_~weak$$choice1~0_190 |v_ULTIMATE.start_main_#t~nondet39#1_153|) (= (ite (or (and .cse4 .cse5) .cse6) 0 .cse7) v_~y$w_buff1_used~0_581) (= v_~y$flush_delayed~0_192 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_111 1) (= v_~y$mem_tmp~0_172 2) (= 2 v_~__unbuffered_p0_EAX~0_214))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_82) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| (mod v_~main$tmp_guard1~0_82 256)) (= v_P2Thread1of1ForFork1_~arg.offset_25 |v_P2Thread1of1ForFork1_#in~arg.offset_25|) (= v_P2Thread1of1ForFork1_~arg.base_25 |v_P2Thread1of1ForFork1_#in~arg.base_25|) (= (ite .cse6 0 v_~y$r_buff0_thd2~0_104) v_~y$r_buff0_thd2~0_103) (= v_~y$w_buff0~0_379 v_~y$w_buff0~0_378) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem31#1_179| |v_ULTIMATE.start_main_#t~mem31#1_181|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_179| |v_ULTIMATE.start_main_#t~ite32#1_176|) (or .cse8 .cse9)) (and (= v_~y$w_buff1~0_381 |v_ULTIMATE.start_main_#t~ite32#1_176|) .cse10 .cse11 .cse12)) (or .cse13 .cse14) (= v_~y$mem_tmp~0_172 |v_ULTIMATE.start_main_#t~ite32#1_176|)) (and (= |v_ULTIMATE.start_main_#t~ite32#1_178| |v_ULTIMATE.start_main_#t~ite32#1_176|) .cse15 (= v_~y$mem_tmp~0_172 v_~y$w_buff0~0_379) .cse11 .cse16))) (= v_~y$r_buff1_thd0~0_284 (ite .cse17 .cse18 (ite (let ((.cse19 (= (mod v_~y$r_buff0_thd0~0_279 256) 0))) (or (and .cse19 .cse20) .cse21 (and .cse19 .cse22))) .cse18 0))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= v_~main$tmp_guard0~0_74 (ite (= (ite (= v_~__unbuffered_cnt~0_207 3) 1 0) 0) 0 1)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_29| v_P1Thread1of1ForFork0_~arg.offset_29) (= v_~y$w_buff0_used~0_594 (ite (and .cse23 .cse24) 0 .cse25)) (= v_~y$w_buff1~0_381 v_~y$w_buff1~0_380) (= (mod v_~main$tmp_guard0~0_74 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= (store |v_#memory_int_740| |v_~#y~0.base_360| (store .cse3 |v_~#y~0.offset_360| |v_P1_#t~ite21_51|)) |v_#memory_int_738|) (= v_P1Thread1of1ForFork0_~arg.base_29 |v_P1Thread1of1ForFork0_#in~arg.base_29|) (= v_~weak$$choice0~0_200 |v_ULTIMATE.start_main_#t~nondet34#1_149|) (let ((.cse26 (= |v_P1Thread1of1ForFork0_#t~mem19_50| |v_P1_#t~mem19_58|))) (or (and .cse23 (= |v_P1_#t~ite20_55| |v_P1Thread1of1ForFork0_#t~ite20_50|) .cse26 (= |v_P1_#t~ite21_51| v_~y$w_buff0~0_378) .cse24) (and (= |v_P1_#t~ite20_55| |v_P1_#t~ite21_51|) (or .cse27 .cse21) (or (and .cse4 .cse5 .cse26 (= v_~y$w_buff1~0_380 |v_P1_#t~ite20_55|)) (and (= |v_ULTIMATE.start_main_#t~ite45#1_163| |v_P1_#t~mem19_58|) (= |v_P1_#t~ite20_55| |v_P1_#t~mem19_58|) (or .cse28 .cse22)))))) (= v_~y$r_buff0_thd0~0_279 (ite .cse17 .cse29 (ite (or .cse30 (and .cse31 .cse22) .cse21) .cse29 (ite (and .cse23 .cse32) 0 .cse29)))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_103 256) 0)) .cse33) (and .cse4 (not (= 0 (mod v_~y$w_buff1_used~0_581 256))))) 0 v_~y$r_buff1_thd2~0_106) v_~y$r_buff1_thd2~0_105) (or (and (= |v_ULTIMATE.start_main_#t~ite45#1_163| v_~y$mem_tmp~0_172) (= |v_ULTIMATE.start_main_#t~mem44#1_219| |v_ULTIMATE.start_main_#t~mem44#1_221|) .cse17) (and (= |v_ULTIMATE.start_main_#t~ite45#1_163| |v_ULTIMATE.start_main_#t~mem44#1_219|) (= v_~y$mem_tmp~0_172 |v_ULTIMATE.start_main_#t~mem44#1_219|) .cse34))))))))))))))))))))) InVars {ULTIMATE.start_main_#t~nondet39#1=|v_ULTIMATE.start_main_#t~nondet39#1_153|, ~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_596, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_149|, ~#y~0.base=|v_~#y~0.base_360|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_221|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_215, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_236|, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_50|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_181|, ~y$w_buff0~0=v_~y$w_buff0~0_379, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_151|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_178|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ULTIMATE.start_main_#t~mem40#1=|v_ULTIMATE.start_main_#t~mem40#1_239|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_151, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_381, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_280, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_740|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_151, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_285, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} OutVars{ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_162|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_89|, ~y$mem_tmp~0=v_~y$mem_tmp~0_172, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_214, ~weak$$choice1~0=v_~weak$$choice1~0_190, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_69|, ~y$flush_delayed~0=v_~y$flush_delayed~0_192, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ULTIMATE.start_main_#t~ite42#1=|v_ULTIMATE.start_main_#t~ite42#1_94|, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_85|, ~weak$$choice0~0=v_~weak$$choice0~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_380, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ULTIMATE.start_main_#t~ite38#1=|v_ULTIMATE.start_main_#t~ite38#1_174|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_207, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_284, ~x~0=v_~x~0_65, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_219|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_594, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_360|, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_27|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_25, ~y$w_buff0~0=v_~y$w_buff0~0_378, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_29|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_69|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_25, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_74, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_151, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_105, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_29, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_279, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_140|, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_151, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_581, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_176|, |v_P1_#t~ite20_55|, |v_P1_#t~mem19_58|, |v_P1_#t~ite21_51|, |v_ULTIMATE.start_main_#t~ite41#1_234|, |v_ULTIMATE.start_main_#t~mem40#1_237|, |v_ULTIMATE.start_main_#t~mem44#1_219|, |v_ULTIMATE.start_main_#t~mem31#1_179|, |v_ULTIMATE.start_main_#t~ite45#1_163|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet39#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem44#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~nondet30#1, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork1_~arg.base, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite42#1, ULTIMATE.start_main_#t~pre29#1, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~mem40#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem36#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite38#1, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [659] L810-->L818: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (let ((.cse8 (not .cse6)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_212 256) 0))) (.cse2 (= (mod v_~y$r_buff1_thd3~0_30 256) 0)) (.cse1 (= 0 (mod v_~y$w_buff1_used~0_202 256))) (.cse7 (= (mod v_~y$w_buff0_used~0_213 256) 0))) (let ((.cse0 (select |v_#memory_int_245| |v_~#y~0.base_176|)) (.cse9 (not .cse7)) (.cse4 (not .cse1)) (.cse5 (not .cse2)) (.cse11 (and .cse8 .cse10))) (and (let ((.cse3 (= |v_P2_#t~mem22_34| |v_P2Thread1of1ForFork1_#t~mem22_1|))) (or (and (or (and (= |v_P2_#t~mem22_34| (select .cse0 |v_~#y~0.offset_176|)) (or .cse1 .cse2) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_34|)) (and .cse3 (= v_~y$w_buff1~0_100 |v_P2_#t~ite23_25|) .cse4 .cse5)) (or .cse6 .cse7) (= |v_P2_#t~ite24_29| |v_P2_#t~ite23_25|)) (and .cse8 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork1_#t~ite23_1|) (= |v_P2_#t~ite24_29| v_~y$w_buff0~0_94) .cse9))) (= (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_201 256) 0)) .cse5)) 0 v_~y$r_buff1_thd3~0_30) v_~y$r_buff1_thd3~0_29) (= (store |v_#memory_int_245| |v_~#y~0.base_176| (store .cse0 |v_~#y~0.offset_176| |v_P2_#t~ite24_29|)) |v_#memory_int_244|) (= (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_213) v_~y$w_buff0_used~0_212) (= v_~y$w_buff1_used~0_201 (ite (or .cse11 (and .cse4 .cse5)) 0 v_~y$w_buff1_used~0_202)) (= (ite .cse11 0 v_~y$r_buff0_thd3~0_30) v_~y$r_buff0_thd3~0_29))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_30, ~#y~0.offset=|v_~#y~0.offset_176|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_213, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_94, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_1|, #memory_int=|v_#memory_int_245|, P2Thread1of1ForFork1_#t~mem22=|v_P2Thread1of1ForFork1_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_176|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_202} OutVars{P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_29, ~#y~0.offset=|v_~#y~0.offset_176|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_244|, ~#y~0.base=|v_~#y~0.base_176|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_201} AuxVars[|v_P2_#t~ite23_25|, |v_P2_#t~ite24_29|, |v_P2_#t~mem22_34|] AssignedVars[P2Thread1of1ForFork1_#t~ite24, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite23, #memory_int, P2Thread1of1ForFork1_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:38:32,535 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 06:38:32,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44101 [2022-12-06 06:38:32,536 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 327 flow [2022-12-06 06:38:32,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:38:32,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:32,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:38:32,537 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 06:38:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 852289461, now seen corresponding path program 1 times [2022-12-06 06:38:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345117860] [2022-12-06 06:38:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:38:32,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:38:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:38:32,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:38:32,691 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:38:32,692 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:38:32,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:38:32,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:38:32,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:38:32,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:38:32,695 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:32,699 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:38:32,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:38:32,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:38:32 BasicIcfg [2022-12-06 06:38:32,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:38:32,788 INFO L158 Benchmark]: Toolchain (without parser) took 77570.13ms. Allocated memory was 181.4MB in the beginning and 626.0MB in the end (delta: 444.6MB). Free memory was 142.8MB in the beginning and 337.1MB in the end (delta: -194.3MB). Peak memory consumption was 250.8MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,788 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 97.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:38:32,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.86ms. Allocated memory is still 181.4MB. Free memory was 142.3MB in the beginning and 114.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.99ms. Allocated memory is still 181.4MB. Free memory was 114.5MB in the beginning and 111.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,789 INFO L158 Benchmark]: Boogie Preprocessor took 48.80ms. Allocated memory is still 181.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,789 INFO L158 Benchmark]: RCFGBuilder took 1049.49ms. Allocated memory is still 181.4MB. Free memory was 109.8MB in the beginning and 125.2MB in the end (delta: -15.5MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,790 INFO L158 Benchmark]: TraceAbstraction took 75838.02ms. Allocated memory was 181.4MB in the beginning and 626.0MB in the end (delta: 444.6MB). Free memory was 124.7MB in the beginning and 337.1MB in the end (delta: -212.4MB). Peak memory consumption was 232.2MB. Max. memory is 8.0GB. [2022-12-06 06:38:32,791 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 97.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.86ms. Allocated memory is still 181.4MB. Free memory was 142.3MB in the beginning and 114.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.99ms. Allocated memory is still 181.4MB. Free memory was 114.5MB in the beginning and 111.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.80ms. Allocated memory is still 181.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1049.49ms. Allocated memory is still 181.4MB. Free memory was 109.8MB in the beginning and 125.2MB in the end (delta: -15.5MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. * TraceAbstraction took 75838.02ms. Allocated memory was 181.4MB in the beginning and 626.0MB in the end (delta: 444.6MB). Free memory was 124.7MB in the beginning and 337.1MB in the end (delta: -212.4MB). Peak memory consumption was 232.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.2s, 117 PlacesBefore, 29 PlacesAfterwards, 108 TransitionsBefore, 20 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 959, independent: 893, independent conditional: 893, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 959, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 959, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 959, independent: 893, independent conditional: 0, independent unconditional: 893, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 764, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 764, independent: 708, independent conditional: 0, independent unconditional: 708, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 507, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 480, dependent conditional: 0, dependent unconditional: 480, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 959, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 764, unknown conditional: 0, unknown unconditional: 764] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1185, Positive conditional cache size: 0, Positive unconditional cache size: 1185, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 282, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 277, dependent conditional: 0, dependent unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 37, independent conditional: 2, independent unconditional: 35, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 53, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 32 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 67, independent conditional: 15, independent unconditional: 52, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 13, independent unconditional: 36, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, independent: 49, independent conditional: 1, independent unconditional: 48, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, independent: 49, independent conditional: 1, independent unconditional: 48, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, independent: 42, independent conditional: 1, independent unconditional: 41, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 33 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 18, independent unconditional: 27, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 53, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 53, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 53, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 25, independent conditional: 8, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 25, independent conditional: 4, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 25, independent conditional: 4, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 29, independent: 25, independent conditional: 4, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 8, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 34, independent conditional: 6, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 11, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 29, independent conditional: 9, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 29, independent conditional: 9, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 33, independent: 29, independent conditional: 9, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 160 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): 88, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 64, Positive conditional cache size: 2, Positive unconditional cache size: 62, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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.4s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 17, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 72, Positive conditional cache size: 2, Positive unconditional cache size: 70, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.1s, 51 PlacesBefore, 51 PlacesAfterwards, 30 TransitionsBefore, 31 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 33, independent unconditional: 5, 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: 38, independent: 38, independent conditional: 33, independent unconditional: 5, 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: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 38, independent: 27, independent conditional: 23, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 100, Positive conditional cache size: 12, Positive unconditional cache size: 88, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=-2, t1985={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 [L778] 1 x = 1 [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L837] 0 pthread_t t1986; [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=-1, t1985={7:0}, t1986={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 pthread_t t1987; [L790] 2 __unbuffered_p1_EAX = x [L793] 2 y = 1 [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, 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=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t1987, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1987, ((void *)0), P2, ((void *)0))=0, t1985={7:0}, t1986={8:0}, t1987={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 y = 2 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, 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=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] EXPR 0 \read(y) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, 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=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 836]: 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: 840]: 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: 838]: 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, 147 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: 75.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 4 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=12, InterpolantAutomatonStates: 54, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 1824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:38:32,844 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...