/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:26:46,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:26:46,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:26:46,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:26:46,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:26:46,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:26:46,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:26:46,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:26:46,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:26:46,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:26:46,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:26:46,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:26:46,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:26:46,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:26:46,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:26:46,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:26:46,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:26:46,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:26:46,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:26:46,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:26:46,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:26:46,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:26:46,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:26:46,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:26:46,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:26:46,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:26:46,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:26:46,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:26:46,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:26:46,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:26:46,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:26:46,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:26:46,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:26:46,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:26:46,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:26:46,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:26:46,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:26:46,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:26:46,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:26:46,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:26:46,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:26:46,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:26:46,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:26:46,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:26:46,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:26:46,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:26:46,803 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:26:46,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:26:46,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:26:46,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:26:46,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:26:46,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:26:46,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:26:46,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:26:46,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:26:46,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:26:46,806 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 04:26:47,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:26:47,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:26:47,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:26:47,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:26:47,095 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:26:47,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2022-12-06 04:26:48,167 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:26:48,455 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:26:48,455 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2022-12-06 04:26:48,489 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb55dfe25/1314cf2aedb941ccb1309781d3b00085/FLAG2e4449f2d [2022-12-06 04:26:48,502 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb55dfe25/1314cf2aedb941ccb1309781d3b00085 [2022-12-06 04:26:48,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:26:48,505 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:26:48,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:26:48,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:26:48,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:26:48,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:26:48" (1/1) ... [2022-12-06 04:26:48,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cb005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:48, skipping insertion in model container [2022-12-06 04:26:48,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:26:48" (1/1) ... [2022-12-06 04:26:48,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:26:48,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:26:48,718 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.opt.i[951,964] [2022-12-06 04:26:48,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:26:48,924 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:26:48,935 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.opt.i[951,964] [2022-12-06 04:26:48,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:26:48,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:26:48,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:26:49,018 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:26:49,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49 WrapperNode [2022-12-06 04:26:49,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:26:49,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:26:49,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:26:49,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:26:49,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,057 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-12-06 04:26:49,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:26:49,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:26:49,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:26:49,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:26:49,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,100 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:26:49,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:26:49,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:26:49,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:26:49,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (1/1) ... [2022-12-06 04:26:49,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:26:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:26:49,146 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 04:26:49,156 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 04:26:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:26:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:26:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:26:49,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:26:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:26:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:26:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:26:49,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:26:49,184 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:26:49,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:26:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:26:49,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:26:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:26:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:26:49,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:26:49,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:26:49,186 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 04:26:49,315 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:26:49,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:26:49,615 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:26:49,956 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:26:49,956 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:26:49,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:26:49 BoogieIcfgContainer [2022-12-06 04:26:49,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:26:49,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:26:49,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:26:49,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:26:49,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:26:48" (1/3) ... [2022-12-06 04:26:49,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b017de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:26:49, skipping insertion in model container [2022-12-06 04:26:49,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:26:49" (2/3) ... [2022-12-06 04:26:49,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b017de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:26:49, skipping insertion in model container [2022-12-06 04:26:49,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:26:49" (3/3) ... [2022-12-06 04:26:49,964 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2022-12-06 04:26:49,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:26:49,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:26:49,978 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:26:50,036 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:26:50,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:26:50,123 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:26:50,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:50,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:26:50,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:26:50,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-06 04:26:50,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:26:50,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:26:50,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-06 04:26:50,186 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:26:50,187 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:26:50,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 04:26:50,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:26:50,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 1832 [2022-12-06 04:27:12,233 WARN L233 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 706 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 04:28:16,484 INFO L203 LiptonReduction]: Total number of compositions: 100 [2022-12-06 04:28:16,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:28:16,504 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;@7171bf4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:28:16,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:28:16,507 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-06 04:28:16,507 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:16,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:16,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:28:16,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 25255022, now seen corresponding path program 1 times [2022-12-06 04:28:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898322160] [2022-12-06 04:28:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:16,878 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 04:28:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:16,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898322160] [2022-12-06 04:28:16,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898322160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:16,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:16,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923546654] [2022-12-06 04:28:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:16,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:16,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:16,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 04:28:16,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:16,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:16,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 04:28:16,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:17,207 INFO L130 PetriNetUnfolder]: 1130/1688 cut-off events. [2022-12-06 04:28:17,208 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:28:17,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3431 conditions, 1688 events. 1130/1688 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8135 event pairs, 386 based on Foata normal form. 0/1499 useless extension candidates. Maximal degree in co-relation 3420. Up to 1078 conditions per place. [2022-12-06 04:28:17,216 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 30 selfloop transitions, 2 changer transitions 8/41 dead transitions. [2022-12-06 04:28:17,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 177 flow [2022-12-06 04:28:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:28:17,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-06 04:28:17,226 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:28:17,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 177 flow [2022-12-06 04:28:17,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:17,229 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 50 flow [2022-12-06 04:28:17,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-06 04:28:17,232 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:28:17,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:17,233 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 50 flow [2022-12-06 04:28:17,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:17,235 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:17,235 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 50 flow [2022-12-06 04:28:17,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 04:28:17,240 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:28:17,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:17,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:28:17,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 04:28:17,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 04:28:17,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:17,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 04:28:17,509 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 04:28:17,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:17,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:17,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:17,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:28:17,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1809045882, now seen corresponding path program 1 times [2022-12-06 04:28:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745939671] [2022-12-06 04:28:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:17,751 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 04:28:17,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:17,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745939671] [2022-12-06 04:28:17,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745939671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:17,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:17,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901648300] [2022-12-06 04:28:17,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:17,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:17,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:17,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:28:17,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:17,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:17,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:28:17,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:17,931 INFO L130 PetriNetUnfolder]: 687/1043 cut-off events. [2022-12-06 04:28:17,931 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 04:28:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 1043 events. 687/1043 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4351 event pairs, 227 based on Foata normal form. 16/1058 useless extension candidates. Maximal degree in co-relation 2205. Up to 921 conditions per place. [2022-12-06 04:28:17,937 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 04:28:17,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2022-12-06 04:28:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:28:17,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 04:28:17,938 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:28:17,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2022-12-06 04:28:17,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:17,941 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 04:28:17,942 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2022-12-06 04:28:17,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:17,942 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:17,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:17,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,946 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:28:17,946 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:28:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:28:17,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 04:28:17,970 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:17,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:28:17,971 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:28:17,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:17,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:17,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:17,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:28:17,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -245846591, now seen corresponding path program 1 times [2022-12-06 04:28:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053191106] [2022-12-06 04:28:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:18,111 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 04:28:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:18,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053191106] [2022-12-06 04:28:18,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053191106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:18,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:18,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:28:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175381065] [2022-12-06 04:28:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:18,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:18,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:18,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:18,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:28:18,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:18,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:18,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:28:18,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:18,391 INFO L130 PetriNetUnfolder]: 1304/1977 cut-off events. [2022-12-06 04:28:18,392 INFO L131 PetriNetUnfolder]: For 197/197 co-relation queries the response was YES. [2022-12-06 04:28:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4261 conditions, 1977 events. 1304/1977 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8943 event pairs, 208 based on Foata normal form. 80/2057 useless extension candidates. Maximal degree in co-relation 4250. Up to 983 conditions per place. [2022-12-06 04:28:18,399 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 34 selfloop transitions, 4 changer transitions 7/45 dead transitions. [2022-12-06 04:28:18,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 45 transitions, 201 flow [2022-12-06 04:28:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:28:18,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-06 04:28:18,400 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:28:18,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 45 transitions, 201 flow [2022-12-06 04:28:18,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:18,401 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:28:18,402 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:28:18,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:18,402 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:18,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:18,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,408 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:28:18,408 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 04:28:18,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 34 events. 3/34 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2022-12-06 04:28:18,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 04:28:18,497 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:18,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 04:28:18,499 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 76 flow [2022-12-06 04:28:18,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:18,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:18,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:18,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:28:18,499 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash 968688291, now seen corresponding path program 1 times [2022-12-06 04:28:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:18,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992785252] [2022-12-06 04:28:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:18,727 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 04:28:18,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992785252] [2022-12-06 04:28:18,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992785252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:18,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:28:18,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810228442] [2022-12-06 04:28:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:18,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:28:18,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:28:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:28:18,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:28:18,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 04:28:18,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:18,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:28:18,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:18,900 INFO L130 PetriNetUnfolder]: 683/1056 cut-off events. [2022-12-06 04:28:18,901 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-12-06 04:28:18,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1056 events. 683/1056 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4211 event pairs, 405 based on Foata normal form. 12/1068 useless extension candidates. Maximal degree in co-relation 2576. Up to 924 conditions per place. [2022-12-06 04:28:18,907 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 04:28:18,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 170 flow [2022-12-06 04:28:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:28:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:28:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:28:18,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 04:28:18,909 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 76 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:28:18,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 170 flow [2022-12-06 04:28:18,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 157 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:18,913 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:18,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 04:28:18,915 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:28:18,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:18,915 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:18,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:18,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:18,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:18,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:18,924 INFO L130 PetriNetUnfolder]: 3/34 cut-off events. [2022-12-06 04:28:18,925 INFO L131 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2022-12-06 04:28:18,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 34 events. 3/34 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2022-12-06 04:28:18,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:18,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:28:19,054 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:19,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:28:19,055 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 75 flow [2022-12-06 04:28:19,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 04:28:19,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:19,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:19,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:28:19,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash -35339931, now seen corresponding path program 1 times [2022-12-06 04:28:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576006198] [2022-12-06 04:28:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:19,235 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 04:28:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:19,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576006198] [2022-12-06 04:28:19,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576006198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:19,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:19,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350385823] [2022-12-06 04:28:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:19,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:19,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:19,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:28:19,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 75 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 04:28:19,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:19,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:28:19,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:19,582 INFO L130 PetriNetUnfolder]: 1354/2102 cut-off events. [2022-12-06 04:28:19,582 INFO L131 PetriNetUnfolder]: For 1017/1017 co-relation queries the response was YES. [2022-12-06 04:28:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4704 conditions, 2102 events. 1354/2102 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10257 event pairs, 387 based on Foata normal form. 120/2222 useless extension candidates. Maximal degree in co-relation 4691. Up to 788 conditions per place. [2022-12-06 04:28:19,591 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 30 selfloop transitions, 3 changer transitions 22/55 dead transitions. [2022-12-06 04:28:19,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 258 flow [2022-12-06 04:28:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:28:19,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-06 04:28:19,594 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 75 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:28:19,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 258 flow [2022-12-06 04:28:19,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:19,597 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 88 flow [2022-12-06 04:28:19,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2022-12-06 04:28:19,601 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 04:28:19,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:19,601 INFO L89 Accepts]: Start accepts. Operand has 38 places, 22 transitions, 88 flow [2022-12-06 04:28:19,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:19,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:19,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 88 flow [2022-12-06 04:28:19,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 22 transitions, 88 flow [2022-12-06 04:28:19,609 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-06 04:28:19,609 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-06 04:28:19,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 37 events. 0/37 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-06 04:28:19,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 88 flow [2022-12-06 04:28:19,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 04:28:19,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L824: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_47 2)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] and [783] $Ultimate##0-->L759: Formula: (and (= v_~y~0_49 v_~__unbuffered_p0_EAX~0_50) (= |v_P0Thread1of1ForFork2_~arg#1.base_5| |v_P0Thread1of1ForFork2_#in~arg#1.base_5|) (= |v_P0Thread1of1ForFork2_~arg#1.offset_5| |v_P0Thread1of1ForFork2_#in~arg#1.offset_5|)) InVars {P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_5|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_5|, ~y~0=v_~y~0_49} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_5|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_5|, ~y~0=v_~y~0_49, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_5|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_5|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset] [2022-12-06 04:28:19,648 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:28:19,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:28:19,651 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 91 flow [2022-12-06 04:28:19,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 04:28:19,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:19,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:19,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:28:19,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -261634505, now seen corresponding path program 1 times [2022-12-06 04:28:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309591761] [2022-12-06 04:28:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:20,592 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 04:28:20,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:20,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309591761] [2022-12-06 04:28:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309591761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:28:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676931572] [2022-12-06 04:28:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:20,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:28:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:28:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:28:20,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:28:20,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:20,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:20,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:28:20,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:20,908 INFO L130 PetriNetUnfolder]: 745/1195 cut-off events. [2022-12-06 04:28:20,908 INFO L131 PetriNetUnfolder]: For 1521/1532 co-relation queries the response was YES. [2022-12-06 04:28:20,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 1195 events. 745/1195 cut-off events. For 1521/1532 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5407 event pairs, 85 based on Foata normal form. 36/1231 useless extension candidates. Maximal degree in co-relation 2783. Up to 772 conditions per place. [2022-12-06 04:28:20,913 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2022-12-06 04:28:20,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 248 flow [2022-12-06 04:28:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:28:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:28:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 04:28:20,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 04:28:20,914 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 91 flow. Second operand 6 states and 56 transitions. [2022-12-06 04:28:20,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 248 flow [2022-12-06 04:28:20,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 235 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 04:28:20,916 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 155 flow [2022-12-06 04:28:20,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 04:28:20,917 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 04:28:20,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:20,917 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 155 flow [2022-12-06 04:28:20,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:20,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:20,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 155 flow [2022-12-06 04:28:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 155 flow [2022-12-06 04:28:20,948 INFO L130 PetriNetUnfolder]: 79/214 cut-off events. [2022-12-06 04:28:20,948 INFO L131 PetriNetUnfolder]: For 323/347 co-relation queries the response was YES. [2022-12-06 04:28:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 214 events. 79/214 cut-off events. For 323/347 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1110 event pairs, 35 based on Foata normal form. 1/204 useless extension candidates. Maximal degree in co-relation 602. Up to 124 conditions per place. [2022-12-06 04:28:20,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 155 flow [2022-12-06 04:28:20,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 04:28:20,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] L856-->L864: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_85 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_99 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_303 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_335 256) 0)) (.cse5 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_334 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse6 (not .cse11)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (select |v_#memory_int_318| |v_~#x~0.base_194|))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| 0)) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_85) v_~x$r_buff0_thd0~0_84) (= (store |v_#memory_int_318| |v_~#x~0.base_194| (store .cse1 |v_~#x~0.offset_194| |v_ULTIMATE.start_main_#t~ite36#1_83|)) |v_#memory_int_317|) (= v_~x$w_buff1_used~0_302 (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_303)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= v_~x$r_buff1_thd0~0_98 (ite (or (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_84 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_99)) (= v_~x$w_buff0_used~0_334 (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_335)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem34#1_105| |v_ULTIMATE.start_main_#t~mem34#1_103|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_102| |v_ULTIMATE.start_main_#t~ite35#1_100|) .cse5 .cse7 (= |v_ULTIMATE.start_main_#t~ite36#1_83| v_~x$w_buff0~0_172) .cse6) (and (= |v_ULTIMATE.start_main_#t~ite36#1_83| |v_ULTIMATE.start_main_#t~ite35#1_100|) (or (and .cse2 .cse7 (= |v_ULTIMATE.start_main_#t~ite35#1_100| v_~x$w_buff1~0_160) .cse3) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem34#1_103| (select .cse1 |v_~#x~0.offset_194|)) (= |v_ULTIMATE.start_main_#t~mem34#1_103| |v_ULTIMATE.start_main_#t~ite35#1_100|))) (or .cse10 .cse11)))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_102|, #memory_int=|v_#memory_int_318|, ~#x~0.base=|v_~#x~0.base_194|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_82|, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_194|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_83|, |v_ULTIMATE.start_main_#t~ite35#1_100|, |v_ULTIMATE.start_main_#t~mem34#1_103|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [670] L824-->L831: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_35 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_184 256) 0)) (.cse1 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse3 (and .cse1 .cse4)) (.cse2 (select |v_#memory_int_196| |v_~#x~0.base_134|)) (.cse6 (not .cse7)) (.cse5 (not .cse8)) (.cse0 (not .cse11))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202) (= (store |v_#memory_int_196| |v_~#x~0.base_134| (store .cse2 |v_~#x~0.offset_134| |v_P2_#t~ite27_31|)) |v_#memory_int_195|) (= v_~x$r_buff0_thd3~0_34 (ite .cse3 0 v_~x$r_buff0_thd3~0_35)) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_34 256) 0)) .cse4) (and (not (= (mod v_~x$w_buff1_used~0_183 256) 0)) .cse5)) 0 v_~x$r_buff1_thd3~0_37)) (= (ite (or .cse3 (and .cse6 .cse5)) 0 v_~x$w_buff1_used~0_184) v_~x$w_buff1_used~0_183) (let ((.cse9 (= |v_P2_#t~mem25_28| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (or .cse7 .cse8) (= (select .cse2 |v_~#x~0.offset_134|) |v_P2_#t~mem25_28|) (= |v_P2_#t~ite26_31| |v_P2_#t~mem25_28|)) (and (= |v_P2_#t~ite26_31| v_~x$w_buff1~0_81) .cse9 .cse6 .cse5)) (= |v_P2_#t~ite26_31| |v_P2_#t~ite27_31|) (or .cse10 .cse11)) (and (= |v_P2_#t~ite26_31| |v_P2Thread1of1ForFork1_#t~ite26_1|) .cse9 (= |v_P2_#t~ite27_31| v_~x$w_buff0~0_76) .cse0 .cse1))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_134|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_196|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_134|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_195|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P2_#t~ite27_31|, |v_P2_#t~ite26_31|, |v_P2_#t~mem25_28|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:28:22,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] L856-->L864: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_85 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_99 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_303 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_335 256) 0)) (.cse5 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_334 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse6 (not .cse11)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (select |v_#memory_int_318| |v_~#x~0.base_194|))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| 0)) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_85) v_~x$r_buff0_thd0~0_84) (= (store |v_#memory_int_318| |v_~#x~0.base_194| (store .cse1 |v_~#x~0.offset_194| |v_ULTIMATE.start_main_#t~ite36#1_83|)) |v_#memory_int_317|) (= v_~x$w_buff1_used~0_302 (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_303)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= v_~x$r_buff1_thd0~0_98 (ite (or (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_84 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_99)) (= v_~x$w_buff0_used~0_334 (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_335)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem34#1_105| |v_ULTIMATE.start_main_#t~mem34#1_103|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_102| |v_ULTIMATE.start_main_#t~ite35#1_100|) .cse5 .cse7 (= |v_ULTIMATE.start_main_#t~ite36#1_83| v_~x$w_buff0~0_172) .cse6) (and (= |v_ULTIMATE.start_main_#t~ite36#1_83| |v_ULTIMATE.start_main_#t~ite35#1_100|) (or (and .cse2 .cse7 (= |v_ULTIMATE.start_main_#t~ite35#1_100| v_~x$w_buff1~0_160) .cse3) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem34#1_103| (select .cse1 |v_~#x~0.offset_194|)) (= |v_ULTIMATE.start_main_#t~mem34#1_103| |v_ULTIMATE.start_main_#t~ite35#1_100|))) (or .cse10 .cse11)))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_102|, #memory_int=|v_#memory_int_318|, ~#x~0.base=|v_~#x~0.base_194|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_82|, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_194|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_83|, |v_ULTIMATE.start_main_#t~ite35#1_100|, |v_ULTIMATE.start_main_#t~mem34#1_103|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [657] L771-->L778: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_196 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_197 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_176 256) 0))) (let ((.cse3 (not .cse6)) (.cse1 (not .cse10)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse7)) (.cse5 (select |v_#memory_int_188| |v_~#x~0.base_128|))) (and (= v_~x$w_buff0_used~0_196 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_197)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_176) v_~x$w_buff1_used~0_175) (let ((.cse8 (= |v_P0_#t~mem3#1_36| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and (= |v_P0_#t~mem3#1_36| (select .cse5 |v_~#x~0.offset_128|)) (or .cse6 .cse7) (= |v_P0_#t~mem3#1_36| |v_P0_#t~ite4#1_33|)) (and .cse3 .cse8 .cse4 (= |v_P0_#t~ite4#1_33| v_~x$w_buff1~0_75))) (= |v_P0_#t~ite4#1_33| |v_P0_#t~ite5#1_31|) (or .cse9 .cse10)) (and .cse0 .cse1 (= |v_P0_#t~ite5#1_31| v_~x$w_buff0~0_74) (= |v_P0_#t~ite4#1_33| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse8))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_44) v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_175 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_37)) (= (store |v_#memory_int_188| |v_~#x~0.base_128| (store .cse5 |v_~#x~0.offset_128| |v_P0_#t~ite5#1_31|)) |v_#memory_int_187|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_188|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196} AuxVars[|v_P0_#t~mem3#1_36|, |v_P0_#t~ite5#1_31|, |v_P0_#t~ite4#1_33|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:28:23,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [756] L856-->L864: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_85 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_99 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_303 256) 0)) (.cse11 (= (mod v_~x$w_buff0_used~0_335 256) 0)) (.cse5 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_334 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse6 (not .cse11)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (select |v_#memory_int_318| |v_~#x~0.base_194|))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| 0)) (= (ite .cse0 0 v_~x$r_buff0_thd0~0_85) v_~x$r_buff0_thd0~0_84) (= (store |v_#memory_int_318| |v_~#x~0.base_194| (store .cse1 |v_~#x~0.offset_194| |v_ULTIMATE.start_main_#t~ite36#1_83|)) |v_#memory_int_317|) (= v_~x$w_buff1_used~0_302 (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_303)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15| (mod v_~main$tmp_guard0~0_22 256)) (= v_~x$r_buff1_thd0~0_98 (ite (or (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_84 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_302 256) 0)) .cse3)) 0 v_~x$r_buff1_thd0~0_99)) (= v_~x$w_buff0_used~0_334 (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_335)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem34#1_105| |v_ULTIMATE.start_main_#t~mem34#1_103|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_102| |v_ULTIMATE.start_main_#t~ite35#1_100|) .cse5 .cse7 (= |v_ULTIMATE.start_main_#t~ite36#1_83| v_~x$w_buff0~0_172) .cse6) (and (= |v_ULTIMATE.start_main_#t~ite36#1_83| |v_ULTIMATE.start_main_#t~ite35#1_100|) (or (and .cse2 .cse7 (= |v_ULTIMATE.start_main_#t~ite35#1_100| v_~x$w_buff1~0_160) .cse3) (and (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~mem34#1_103| (select .cse1 |v_~#x~0.offset_194|)) (= |v_ULTIMATE.start_main_#t~mem34#1_103| |v_ULTIMATE.start_main_#t~ite35#1_100|))) (or .cse10 .cse11)))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_303, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_335, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_102|, #memory_int=|v_#memory_int_318|, ~#x~0.base=|v_~#x~0.base_194|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_172, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_82|, ~#x~0.offset=|v_~#x~0.offset_194|, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_302, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, #memory_int=|v_#memory_int_317|, ~#x~0.base=|v_~#x~0.base_194|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[|v_ULTIMATE.start_main_#t~ite36#1_83|, |v_ULTIMATE.start_main_#t~ite35#1_100|, |v_ULTIMATE.start_main_#t~mem34#1_103|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [664] L807-->L814: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_88 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff0_used~0_179 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_156 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd2~0_78 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_178 256) 0))) (.cse5 (not .cse11))) (let ((.cse1 (and .cse6 .cse5)) (.cse0 (select |v_#memory_int_158| |v_~#x~0.base_110|)) (.cse2 (not .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse10))) (and (= (store |v_#memory_int_158| |v_~#x~0.base_110| (store .cse0 |v_~#x~0.offset_110| |v_P1_#t~ite24_25|)) |v_#memory_int_157|) (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_156) v_~x$w_buff1_used~0_155) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_179) v_~x$w_buff0_used~0_178) (= v_~x$r_buff1_thd2~0_77 (ite (or (and .cse6 (not (= 0 (mod v_~x$r_buff0_thd2~0_87 256)))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_155 256) 0)))) 0 v_~x$r_buff1_thd2~0_78)) (= v_~x$r_buff0_thd2~0_87 (ite .cse1 0 v_~x$r_buff0_thd2~0_88)) (let ((.cse9 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_32|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_25|) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_32|) (= (select .cse0 |v_~#x~0.offset_110|) |v_P1_#t~mem22_32|) (or .cse7 .cse8)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_57) .cse2 .cse9 .cse3)) (or .cse10 .cse11)) (and (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_64) .cse4 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork0_#t~ite23_1|) .cse9 .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, #memory_int=|v_#memory_int_158|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_157|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_178} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~mem22_32|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 04:28:24,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [798] L856-->L778: Formula: (let ((.cse17 (= (mod v_~x$w_buff0_used~0_612 256) 0)) (.cse16 (= (mod v_~x$r_buff0_thd0~0_180 256) 0))) (let ((.cse18 (not .cse16)) (.cse19 (not .cse17))) (let ((.cse2 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_612))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse14 (= (mod v_~x$w_buff1_used~0_564 256) 0)) (.cse15 (= (mod v_~x$r_buff1_thd0~0_199 256) 0)) (.cse1 (not .cse5))) (let ((.cse23 (and .cse18 .cse1)) (.cse10 (not .cse15)) (.cse13 (not .cse14))) (let ((.cse22 (ite (or .cse23 (and .cse10 .cse13)) 0 v_~x$w_buff1_used~0_564)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_176 256) 0))) (let ((.cse0 (not .cse4)) (.cse21 (not (= (mod v_~x$w_buff0_used~0_610 256) 0))) (.cse7 (= (mod .cse22 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd1~0_145 256) 0))) (let ((.cse11 (select |v_#memory_int_609| |v_~#x~0.base_294|)) (.cse8 (not .cse6)) (.cse9 (not .cse7)) (.cse20 (and .cse0 .cse21))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~x$w_buff0_used~0_610 (ite (and .cse0 .cse1) 0 .cse2)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (let ((.cse3 (= |v_P0_#t~mem3#1_63| |v_P0Thread1of1ForFork2_#t~mem3#1_54|))) (or (and .cse3 .cse0 .cse1 (= |v_P0_#t~ite4#1_60| |v_P0Thread1of1ForFork2_#t~ite4#1_54|) (= |v_P0_#t~ite5#1_58| v_~x$w_buff0~0_342)) (and (or .cse4 .cse5) (or (and (= |v_P0_#t~mem3#1_63| |v_ULTIMATE.start_main_#t~ite36#1_162|) (= |v_P0_#t~mem3#1_63| |v_P0_#t~ite4#1_60|) (or .cse6 .cse7)) (and .cse3 (= |v_P0_#t~ite4#1_60| v_~x$w_buff1~0_314) .cse8 .cse9)) (= |v_P0_#t~ite4#1_60| |v_P0_#t~ite5#1_58|)))) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_179 256) 0)) .cse1) (and .cse10 .cse9)) 0 v_~x$r_buff1_thd0~0_199) v_~x$r_buff1_thd0~0_198) (= (store |v_#memory_int_609| |v_~#x~0.base_294| (store .cse11 |v_~#x~0.offset_294| |v_P0_#t~ite5#1_58|)) |v_#memory_int_607|) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem34#1_208| |v_ULTIMATE.start_main_#t~mem34#1_206|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_203| |v_ULTIMATE.start_main_#t~ite36#1_162|) (or (and .cse12 .cse10 .cse13 (= |v_ULTIMATE.start_main_#t~ite35#1_203| v_~x$w_buff1~0_314)) (and (or .cse14 .cse15) (= |v_ULTIMATE.start_main_#t~mem34#1_206| (select .cse11 |v_~#x~0.offset_294|)) (= |v_ULTIMATE.start_main_#t~mem34#1_206| |v_ULTIMATE.start_main_#t~ite35#1_203|))) (or .cse16 .cse17)) (and .cse12 .cse18 (= v_~x$w_buff0~0_342 |v_ULTIMATE.start_main_#t~ite36#1_162|) .cse19 (= |v_ULTIMATE.start_main_#t~ite35#1_205| |v_ULTIMATE.start_main_#t~ite35#1_203|)))) (= v_~x$r_buff0_thd1~0_175 (ite .cse20 0 v_~x$r_buff0_thd1~0_176)) (= v_~x$r_buff1_thd1~0_144 (ite (or (and .cse8 (not (= (mod v_~x$w_buff1_used~0_562 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_175 256) 0)) .cse21)) 0 v_~x$r_buff1_thd1~0_145)) (= v_~x$w_buff1_used~0_562 (ite (or (and .cse8 .cse9) .cse20) 0 .cse22)) (= v_~x$r_buff0_thd0~0_179 (ite .cse23 0 v_~x$r_buff0_thd0~0_180)) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_342, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_180, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_176, ~#x~0.offset=|v_~#x~0.offset_294|, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_564, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_145, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_208|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_199, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_54|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_205|, #memory_int=|v_#memory_int_609|, ~#x~0.base=|v_~#x~0.base_294|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_342, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_179, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_175, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_161|, ~#x~0.offset=|v_~#x~0.offset_294|, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_562, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_198, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, #memory_int=|v_#memory_int_607|, ~#x~0.base=|v_~#x~0.base_294|, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_P0_#t~ite4#1_60|, |v_P0_#t~ite5#1_58|, |v_P0_#t~mem3#1_63|, |v_ULTIMATE.start_main_#t~ite35#1_203|, |v_ULTIMATE.start_main_#t~mem34#1_206|, |v_ULTIMATE.start_main_#t~ite36#1_162|] AssignedVars[~x$r_buff0_thd0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite36#1, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~ite4#1, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, P0Thread1of1ForFork2_#t~ite5#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:25,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [670] L824-->L831: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_35 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_184 256) 0)) (.cse1 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse3 (and .cse1 .cse4)) (.cse2 (select |v_#memory_int_196| |v_~#x~0.base_134|)) (.cse6 (not .cse7)) (.cse5 (not .cse8)) (.cse0 (not .cse11))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202) (= (store |v_#memory_int_196| |v_~#x~0.base_134| (store .cse2 |v_~#x~0.offset_134| |v_P2_#t~ite27_31|)) |v_#memory_int_195|) (= v_~x$r_buff0_thd3~0_34 (ite .cse3 0 v_~x$r_buff0_thd3~0_35)) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_34 256) 0)) .cse4) (and (not (= (mod v_~x$w_buff1_used~0_183 256) 0)) .cse5)) 0 v_~x$r_buff1_thd3~0_37)) (= (ite (or .cse3 (and .cse6 .cse5)) 0 v_~x$w_buff1_used~0_184) v_~x$w_buff1_used~0_183) (let ((.cse9 (= |v_P2_#t~mem25_28| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (or .cse7 .cse8) (= (select .cse2 |v_~#x~0.offset_134|) |v_P2_#t~mem25_28|) (= |v_P2_#t~ite26_31| |v_P2_#t~mem25_28|)) (and (= |v_P2_#t~ite26_31| v_~x$w_buff1~0_81) .cse9 .cse6 .cse5)) (= |v_P2_#t~ite26_31| |v_P2_#t~ite27_31|) (or .cse10 .cse11)) (and (= |v_P2_#t~ite26_31| |v_P2Thread1of1ForFork1_#t~ite26_1|) .cse9 (= |v_P2_#t~ite27_31| v_~x$w_buff0~0_76) .cse0 .cse1))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_134|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_196|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_134|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_195|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P2_#t~ite27_31|, |v_P2_#t~ite26_31|, |v_P2_#t~mem25_28|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 04:28:25,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [799] L856-->L814: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_618 256) 0)) (.cse15 (= 0 (mod v_~x$r_buff0_thd0~0_184 256)))) (let ((.cse21 (not .cse15)) (.cse22 (not .cse16))) (let ((.cse2 (ite (and .cse21 .cse22) 0 v_~x$w_buff0_used~0_618))) (let ((.cse8 (= (mod .cse2 256) 0))) (let ((.cse20 (= (mod v_~x$w_buff1_used~0_570 256) 0)) (.cse19 (= 0 (mod v_~x$r_buff1_thd0~0_203 256))) (.cse0 (not .cse8))) (let ((.cse23 (and .cse21 .cse0)) (.cse14 (not .cse19)) (.cse18 (not .cse20))) (let ((.cse9 (= (mod v_~x$r_buff0_thd2~0_272 256) 0)) (.cse6 (ite (or .cse23 (and .cse14 .cse18)) 0 v_~x$w_buff1_used~0_570))) (let ((.cse10 (= (mod .cse6 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd2~0_275 256) 0)) (.cse13 (not (= (mod v_~x$w_buff0_used~0_616 256) 0))) (.cse1 (not .cse9))) (let ((.cse3 (and .cse13 .cse1)) (.cse4 (not .cse11)) (.cse5 (not .cse10)) (.cse7 (select |v_#memory_int_615| |v_~#x~0.base_296|))) (and (= (ite (and .cse0 .cse1) 0 .cse2) v_~x$w_buff0_used~0_616) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= v_~x$w_buff1_used~0_568 (ite (or .cse3 (and .cse4 .cse5)) 0 .cse6)) (= (store |v_#memory_int_615| |v_~#x~0.base_296| (store .cse7 |v_~#x~0.offset_296| |v_P1_#t~ite24_42|)) |v_#memory_int_613|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (let ((.cse12 (= |v_P1Thread1of1ForFork0_#t~mem22_34| |v_P1_#t~mem22_49|))) (or (and (or .cse8 .cse9) (or (and (= |v_P1_#t~mem22_49| |v_ULTIMATE.start_main_#t~ite36#1_166|) (or .cse10 .cse11) (= |v_P1_#t~ite23_46| |v_P1_#t~mem22_49|)) (and .cse12 .cse4 .cse5 (= |v_P1_#t~ite23_46| v_~x$w_buff1~0_316))) (= |v_P1_#t~ite23_46| |v_P1_#t~ite24_42|)) (and .cse12 (= |v_P1_#t~ite23_46| |v_P1Thread1of1ForFork0_#t~ite23_34|) .cse0 (= |v_P1_#t~ite24_42| v_~x$w_buff0~0_344) .cse1))) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_272) v_~x$r_buff0_thd2~0_271) (= (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_568 256) 0))) (and .cse13 (not (= (mod v_~x$r_buff0_thd2~0_271 256) 0)))) 0 v_~x$r_buff1_thd2~0_275) v_~x$r_buff1_thd2~0_274) (= v_~x$r_buff1_thd0~0_202 (ite (or (and .cse14 .cse5) (and (not (= (mod v_~x$r_buff0_thd0~0_183 256) 0)) .cse0)) 0 v_~x$r_buff1_thd0~0_203)) (let ((.cse17 (= |v_ULTIMATE.start_main_#t~mem34#1_214| |v_ULTIMATE.start_main_#t~mem34#1_212|))) (or (and (or .cse15 .cse16) (or (and .cse14 .cse17 .cse18 (= |v_ULTIMATE.start_main_#t~ite35#1_209| v_~x$w_buff1~0_316)) (and (= |v_ULTIMATE.start_main_#t~mem34#1_212| (select .cse7 |v_~#x~0.offset_296|)) (= |v_ULTIMATE.start_main_#t~mem34#1_212| |v_ULTIMATE.start_main_#t~ite35#1_209|) (or .cse19 .cse20))) (= |v_ULTIMATE.start_main_#t~ite35#1_209| |v_ULTIMATE.start_main_#t~ite36#1_166|)) (and .cse17 (= |v_ULTIMATE.start_main_#t~ite35#1_209| |v_ULTIMATE.start_main_#t~ite35#1_211|) .cse21 (= v_~x$w_buff0~0_344 |v_ULTIMATE.start_main_#t~ite36#1_166|) .cse22))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63| (mod v_~main$tmp_guard0~0_88 256)) (= v_~x$r_buff0_thd0~0_183 (ite .cse23 0 v_~x$r_buff0_thd0~0_184)))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_344, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_34|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_184, ~#x~0.offset=|v_~#x~0.offset_296|, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_275, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_570, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_88, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_214|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_203, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_618, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_211|, #memory_int=|v_#memory_int_615|, ~#x~0.base=|v_~#x~0.base_296|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_344, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_183, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_165|, ~#x~0.offset=|v_~#x~0.offset_296|, ~x$w_buff1~0=v_~x$w_buff1~0_316, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_19|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_274, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_568, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_202, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, #memory_int=|v_#memory_int_613|, ~#x~0.base=|v_~#x~0.base_296|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[|v_P1_#t~ite24_42|, |v_P1_#t~ite23_46|, |v_P1_#t~mem22_49|, |v_ULTIMATE.start_main_#t~mem34#1_212|, |v_ULTIMATE.start_main_#t~ite36#1_166|, |v_ULTIMATE.start_main_#t~ite35#1_209|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite36#1, P1Thread1of1ForFork0_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:27,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [664] L807-->L814: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_88 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff0_used~0_179 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_156 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd2~0_78 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_178 256) 0))) (.cse5 (not .cse11))) (let ((.cse1 (and .cse6 .cse5)) (.cse0 (select |v_#memory_int_158| |v_~#x~0.base_110|)) (.cse2 (not .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse10))) (and (= (store |v_#memory_int_158| |v_~#x~0.base_110| (store .cse0 |v_~#x~0.offset_110| |v_P1_#t~ite24_25|)) |v_#memory_int_157|) (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_156) v_~x$w_buff1_used~0_155) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_179) v_~x$w_buff0_used~0_178) (= v_~x$r_buff1_thd2~0_77 (ite (or (and .cse6 (not (= 0 (mod v_~x$r_buff0_thd2~0_87 256)))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_155 256) 0)))) 0 v_~x$r_buff1_thd2~0_78)) (= v_~x$r_buff0_thd2~0_87 (ite .cse1 0 v_~x$r_buff0_thd2~0_88)) (let ((.cse9 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_32|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_25|) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_32|) (= (select .cse0 |v_~#x~0.offset_110|) |v_P1_#t~mem22_32|) (or .cse7 .cse8)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_57) .cse2 .cse9 .cse3)) (or .cse10 .cse11)) (and (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_64) .cse4 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork0_#t~ite23_1|) .cse9 .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, #memory_int=|v_#memory_int_158|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_157|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_178} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~mem22_32|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 04:28:27,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [797] L856-->L831: Formula: (let ((.cse11 (= (mod v_~x$w_buff0_used~0_606 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd0~0_176 256) 0))) (let ((.cse18 (not .cse12)) (.cse19 (not .cse11))) (let ((.cse23 (ite (and .cse18 .cse19) 0 v_~x$w_buff0_used~0_606))) (let ((.cse8 (= (mod .cse23 256) 0))) (let ((.cse16 (= (mod v_~x$r_buff1_thd0~0_195 256) 0)) (.cse17 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse0 (not .cse8))) (let ((.cse22 (and .cse18 .cse0)) (.cse14 (not .cse17)) (.cse10 (not .cse16))) (let ((.cse21 (ite (or .cse22 (and .cse14 .cse10)) 0 v_~x$w_buff1_used~0_558)) (.cse7 (= (mod v_~x$r_buff0_thd3~0_165 256) 0))) (let ((.cse9 (not (= (mod v_~x$w_buff0_used~0_604 256) 0))) (.cse1 (not .cse7)) (.cse3 (= (mod .cse21 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd3~0_169 256) 0))) (let ((.cse5 (not .cse4)) (.cse6 (not .cse3)) (.cse15 (select |v_#memory_int_603| |v_~#x~0.base_292|)) (.cse20 (and .cse9 .cse1))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (let ((.cse2 (= |v_P2Thread1of1ForFork1_#t~mem25_86| |v_P2_#t~mem25_71|))) (or (and .cse0 (= |v_P2_#t~ite26_74| |v_P2Thread1of1ForFork1_#t~ite26_86|) (= |v_P2_#t~ite27_74| v_~x$w_buff0~0_340) .cse1 .cse2) (and (or (and (or .cse3 .cse4) (= |v_P2_#t~mem25_71| |v_ULTIMATE.start_main_#t~ite36#1_158|) (= |v_P2_#t~ite26_74| |v_P2_#t~mem25_71|)) (and (= |v_P2_#t~ite26_74| v_~x$w_buff1~0_312) .cse5 .cse6 .cse2)) (or .cse7 .cse8) (= |v_P2_#t~ite26_74| |v_P2_#t~ite27_74|)))) (= v_~x$r_buff1_thd3~0_168 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_164 256) 0)) .cse9) (and (not (= (mod v_~x$w_buff1_used~0_556 256) 0)) .cse5)) 0 v_~x$r_buff1_thd3~0_169)) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_175 256) 0))) (and .cse6 .cse10)) 0 v_~x$r_buff1_thd0~0_195) v_~x$r_buff1_thd0~0_194) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~mem34#1_202| |v_ULTIMATE.start_main_#t~mem34#1_200|))) (or (and (or .cse11 .cse12) (= |v_ULTIMATE.start_main_#t~ite35#1_197| |v_ULTIMATE.start_main_#t~ite36#1_158|) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_197| v_~x$w_buff1~0_312) .cse13 .cse14 .cse10) (and (= |v_ULTIMATE.start_main_#t~mem34#1_200| |v_ULTIMATE.start_main_#t~ite35#1_197|) (= |v_ULTIMATE.start_main_#t~mem34#1_200| (select .cse15 |v_~#x~0.offset_292|)) (or .cse16 .cse17)))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_199| |v_ULTIMATE.start_main_#t~ite35#1_197|) .cse18 (= v_~x$w_buff0~0_340 |v_ULTIMATE.start_main_#t~ite36#1_158|) .cse19 .cse13))) (= (ite (or .cse20 (and .cse5 .cse6)) 0 .cse21) v_~x$w_buff1_used~0_556) (= (store |v_#memory_int_603| |v_~#x~0.base_292| (store .cse15 |v_~#x~0.offset_292| |v_P2_#t~ite27_74|)) |v_#memory_int_601|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|) (= v_~x$r_buff0_thd0~0_175 (ite .cse22 0 v_~x$r_buff0_thd0~0_176)) (= v_~x$w_buff0_used~0_604 (ite (and .cse0 .cse1) 0 .cse23)) (= (ite .cse20 0 v_~x$r_buff0_thd3~0_165) v_~x$r_buff0_thd3~0_164))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_176, ~#x~0.offset=|v_~#x~0.offset_292|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_86|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_169, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_165, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_202|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_195, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_199|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_86|, #memory_int=|v_#memory_int_603|, ~#x~0.base=|v_~#x~0.base_292|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_175, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_157|, ~#x~0.offset=|v_~#x~0.offset_292|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_556, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_164, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_604, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_45|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, #memory_int=|v_#memory_int_601|, ~#x~0.base=|v_~#x~0.base_292|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_59|} AuxVars[|v_P2_#t~ite27_74|, |v_P2_#t~mem25_71|, |v_ULTIMATE.start_main_#t~ite36#1_158|, |v_ULTIMATE.start_main_#t~ite35#1_197|, |v_ULTIMATE.start_main_#t~mem34#1_200|, |v_P2_#t~ite26_74|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite36#1, P2Thread1of1ForFork1_#t~mem25, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite35#1, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:28:28,559 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:28:28,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7643 [2022-12-06 04:28:28,560 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 175 flow [2022-12-06 04:28:28,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:28:28,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:28,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:28,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:28:28,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash 748722795, now seen corresponding path program 1 times [2022-12-06 04:28:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:28,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112704046] [2022-12-06 04:28:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:28,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:28,802 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 04:28:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:28,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112704046] [2022-12-06 04:28:28,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112704046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:28,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:28,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:28:28,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57738161] [2022-12-06 04:28:28,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:28,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:28:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:28:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:28:28,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 04:28:28,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 175 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 04:28:28,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:28,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 04:28:28,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:29,025 INFO L130 PetriNetUnfolder]: 547/914 cut-off events. [2022-12-06 04:28:29,025 INFO L131 PetriNetUnfolder]: For 1669/1736 co-relation queries the response was YES. [2022-12-06 04:28:29,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 914 events. 547/914 cut-off events. For 1669/1736 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4319 event pairs, 94 based on Foata normal form. 127/1032 useless extension candidates. Maximal degree in co-relation 3073. Up to 417 conditions per place. [2022-12-06 04:28:29,029 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 52 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2022-12-06 04:28:29,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 445 flow [2022-12-06 04:28:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:28:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:28:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 04:28:29,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-06 04:28:29,031 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 175 flow. Second operand 4 states and 67 transitions. [2022-12-06 04:28:29,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 445 flow [2022-12-06 04:28:29,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 403 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:29,033 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-06 04:28:29,034 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 04:28:29,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:29,034 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:29,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:29,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,071 INFO L130 PetriNetUnfolder]: 144/318 cut-off events. [2022-12-06 04:28:29,071 INFO L131 PetriNetUnfolder]: For 487/515 co-relation queries the response was YES. [2022-12-06 04:28:29,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 318 events. 144/318 cut-off events. For 487/515 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1662 event pairs, 47 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 980. Up to 174 conditions per place. [2022-12-06 04:28:29,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 04:28:29,077 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:29,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 04:28:29,080 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 199 flow [2022-12-06 04:28:29,080 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 04:28:29,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:29,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:29,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:28:29,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1093787365, now seen corresponding path program 1 times [2022-12-06 04:28:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:29,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154157379] [2022-12-06 04:28:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:29,274 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 04:28:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154157379] [2022-12-06 04:28:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154157379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:29,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:28:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522863387] [2022-12-06 04:28:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:28:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:28:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:28:29,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-06 04:28:29,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 199 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 04:28:29,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:29,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-06 04:28:29,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:29,443 INFO L130 PetriNetUnfolder]: 253/470 cut-off events. [2022-12-06 04:28:29,443 INFO L131 PetriNetUnfolder]: For 749/771 co-relation queries the response was YES. [2022-12-06 04:28:29,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 470 events. 253/470 cut-off events. For 749/771 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2031 event pairs, 26 based on Foata normal form. 75/540 useless extension candidates. Maximal degree in co-relation 1671. Up to 198 conditions per place. [2022-12-06 04:28:29,445 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 51 selfloop transitions, 8 changer transitions 1/62 dead transitions. [2022-12-06 04:28:29,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 435 flow [2022-12-06 04:28:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:28:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:28:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 04:28:29,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-06 04:28:29,448 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 199 flow. Second operand 5 states and 69 transitions. [2022-12-06 04:28:29,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 435 flow [2022-12-06 04:28:29,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 423 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:28:29,451 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-06 04:28:29,453 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 04:28:29,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:29,453 INFO L89 Accepts]: Start accepts. Operand has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:29,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:29,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,473 INFO L130 PetriNetUnfolder]: 58/170 cut-off events. [2022-12-06 04:28:29,473 INFO L131 PetriNetUnfolder]: For 307/323 co-relation queries the response was YES. [2022-12-06 04:28:29,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 170 events. 58/170 cut-off events. For 307/323 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 768 event pairs, 18 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 588. Up to 80 conditions per place. [2022-12-06 04:28:29,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 04:28:29,478 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:28:29,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 04:28:29,479 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 213 flow [2022-12-06 04:28:29,479 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 04:28:29,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:29,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:29,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:28:29,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1749728156, now seen corresponding path program 1 times [2022-12-06 04:28:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:29,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131170284] [2022-12-06 04:28:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:28:29,716 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 04:28:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:28:29,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131170284] [2022-12-06 04:28:29,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131170284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:28:29,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:28:29,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:28:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346619222] [2022-12-06 04:28:29,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:28:29,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:28:29,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:28:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:28:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:28:29,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:28:29,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 04:28:29,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:28:29,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:28:29,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:28:29,856 INFO L130 PetriNetUnfolder]: 142/275 cut-off events. [2022-12-06 04:28:29,856 INFO L131 PetriNetUnfolder]: For 536/557 co-relation queries the response was YES. [2022-12-06 04:28:29,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 275 events. 142/275 cut-off events. For 536/557 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1051 event pairs, 25 based on Foata normal form. 21/291 useless extension candidates. Maximal degree in co-relation 1071. Up to 101 conditions per place. [2022-12-06 04:28:29,858 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 31 selfloop transitions, 11 changer transitions 9/52 dead transitions. [2022-12-06 04:28:29,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 394 flow [2022-12-06 04:28:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:28:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:28:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 04:28:29,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38 [2022-12-06 04:28:29,859 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 213 flow. Second operand 6 states and 57 transitions. [2022-12-06 04:28:29,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 394 flow [2022-12-06 04:28:29,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 335 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:28:29,861 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 172 flow [2022-12-06 04:28:29,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2022-12-06 04:28:29,862 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 04:28:29,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:28:29,862 INFO L89 Accepts]: Start accepts. Operand has 46 places, 28 transitions, 172 flow [2022-12-06 04:28:29,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:28:29,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:28:29,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 28 transitions, 172 flow [2022-12-06 04:28:29,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 28 transitions, 172 flow [2022-12-06 04:28:29,871 INFO L130 PetriNetUnfolder]: 18/58 cut-off events. [2022-12-06 04:28:29,871 INFO L131 PetriNetUnfolder]: For 78/82 co-relation queries the response was YES. [2022-12-06 04:28:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 58 events. 18/58 cut-off events. For 78/82 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 6 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 174. Up to 20 conditions per place. [2022-12-06 04:28:29,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 28 transitions, 172 flow [2022-12-06 04:28:29,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 04:28:32,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L831-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_17| 0) (= v_~__unbuffered_cnt~0_139 (+ v_~__unbuffered_cnt~0_140 1)) (= |v_P2Thread1of1ForFork1_#res.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [769] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_89) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 04:28:32,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] L778-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P0Thread1of1ForFork2_#res#1.base_13| 0) (= |v_P0Thread1of1ForFork2_#res#1.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P0Thread1of1ForFork2_#res#1.offset=|v_P0Thread1of1ForFork2_#res#1.offset_13|, P0Thread1of1ForFork2_#res#1.base=|v_P0Thread1of1ForFork2_#res#1.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res#1.offset, P0Thread1of1ForFork2_#res#1.base, ~__unbuffered_cnt~0] and [769] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_89) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 04:28:32,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] L814-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= |v_P1Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_15|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [769] L853-3-->L856: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_89) 1 0) 0) 0 1) v_~main$tmp_guard0~0_34) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1] [2022-12-06 04:28:32,339 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L824: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_47 2)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] and [808] $Ultimate##0-->L831: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd3~0_189 256) 0))) (let ((.cse1 (not .cse4)) (.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_670 256))))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_671 256) 0)) (.cse2 (and .cse1 .cse0)) (.cse5 (select |v_#memory_int_656| |v_~#x~0.base_316|))) (and (= |v_P0Thread1of1ForFork2_#in~arg#1.base_21| |v_P0Thread1of1ForFork2_~arg#1.base_21|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_188 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_606 256) 0)) .cse1)) 0 v_~x$r_buff0_thd3~0_189) v_~x$r_buff1_thd3~0_192) (= v_~x$r_buff0_thd1~0_220 v_~x$r_buff1_thd1~0_172) (= v_~x$w_buff1_used~0_606 (ite (or .cse2 (and .cse1 (not .cse3))) 0 v_~x$w_buff0_used~0_671)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57| 0)) (= v_~x$w_buff0~0_380 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|) (or (and .cse1 (= |v_P2Thread1of1ForFork1_#t~mem25_98| |v_P2_#t~mem25_82|) (= |v_P2_#t~ite26_85| |v_P2Thread1of1ForFork1_#t~ite26_98|) (= |v_P2_#t~ite27_85| v_~x$w_buff0~0_380)) (and .cse4 (= |v_P2_#t~mem25_82| (select .cse5 |v_~#x~0.offset_316|)) (= |v_P2_#t~ite26_85| |v_P2_#t~mem25_82|) (= |v_P2_#t~ite26_85| |v_P2_#t~ite27_85|))) (= v_~x$w_buff0_used~0_670 (ite .cse1 0 1)) (= (ite .cse3 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0~0_381 v_~x$w_buff1~0_336) (= v_~x$r_buff0_thd1~0_219 1) (= v_~x$r_buff0_thd3~0_188 (ite .cse2 0 v_~x$r_buff0_thd3~0_189)) (= v_~x$r_buff0_thd0~0_209 v_~x$r_buff1_thd0~0_228) (= v_~x$r_buff0_thd2~0_297 v_~x$r_buff1_thd2~0_298) (= v_~y~0_103 v_~__unbuffered_p0_EAX~0_84) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_21| |v_P0Thread1of1ForFork2_~arg#1.offset_21|) (= (store |v_#memory_int_656| |v_~#x~0.base_316| (store .cse5 |v_~#x~0.offset_316| |v_P2_#t~ite27_85|)) |v_#memory_int_655|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_381, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_209, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_220, ~#x~0.offset=|v_~#x~0.offset_316|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_98|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_189, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_297, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_671, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_98|, #memory_int=|v_#memory_int_656|, ~#x~0.base=|v_~#x~0.base_316|, ~y~0=v_~y~0_103} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_380, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_219, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_192, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_172, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_188, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_51|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|, ~y~0=v_~y~0_103, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_209, ~#x~0.offset=|v_~#x~0.offset_316|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_336, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_298, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_297, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_228, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_670, #memory_int=|v_#memory_int_655|, ~#x~0.base=|v_~#x~0.base_316|} AuxVars[|v_P2_#t~ite27_85|, |v_P2_#t~mem25_82|, |v_P2_#t~ite26_85|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] [2022-12-06 04:28:34,713 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 04:28:34,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4852 [2022-12-06 04:28:34,714 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 176 flow [2022-12-06 04:28:34,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 04:28:34,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:28:34,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:34,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:28:34,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:28:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:28:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1077185641, now seen corresponding path program 1 times [2022-12-06 04:28:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:28:34,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656283190] [2022-12-06 04:28:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:28:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:28:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:28:34,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:28:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:28:34,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:28:34,870 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:28:34,870 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:28:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:28:34,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:28:34,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:28:34,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:28:34,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:28:34,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:28:34,873 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:28:34,877 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:28:34,877 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:28:34,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:28:34 BasicIcfg [2022-12-06 04:28:34,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:28:34,933 INFO L158 Benchmark]: Toolchain (without parser) took 106428.76ms. Allocated memory was 212.9MB in the beginning and 1.0GB in the end (delta: 795.9MB). Free memory was 187.8MB in the beginning and 442.2MB in the end (delta: -254.4MB). Peak memory consumption was 542.0MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 212.9MB. Free memory was 190.1MB in the beginning and 190.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.73ms. Allocated memory is still 212.9MB. Free memory was 187.8MB in the beginning and 160.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.50ms. Allocated memory is still 212.9MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: Boogie Preprocessor took 46.36ms. Allocated memory is still 212.9MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: RCFGBuilder took 853.23ms. Allocated memory was 212.9MB in the beginning and 299.9MB in the end (delta: 87.0MB). Free memory was 155.9MB in the beginning and 257.3MB in the end (delta: -101.4MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,934 INFO L158 Benchmark]: TraceAbstraction took 104973.55ms. Allocated memory was 299.9MB in the beginning and 1.0GB in the end (delta: 708.8MB). Free memory was 256.7MB in the beginning and 442.2MB in the end (delta: -185.5MB). Peak memory consumption was 523.9MB. Max. memory is 8.0GB. [2022-12-06 04:28:34,943 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.15ms. Allocated memory is still 212.9MB. Free memory was 190.1MB in the beginning and 190.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.73ms. Allocated memory is still 212.9MB. Free memory was 187.8MB in the beginning and 160.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.50ms. Allocated memory is still 212.9MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.36ms. Allocated memory is still 212.9MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 853.23ms. Allocated memory was 212.9MB in the beginning and 299.9MB in the end (delta: 87.0MB). Free memory was 155.9MB in the beginning and 257.3MB in the end (delta: -101.4MB). Peak memory consumption was 62.2MB. Max. memory is 8.0GB. * TraceAbstraction took 104973.55ms. Allocated memory was 299.9MB in the beginning and 1.0GB in the end (delta: 708.8MB). Free memory was 256.7MB in the beginning and 442.2MB in the end (delta: -185.5MB). Peak memory consumption was 523.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.3s, 130 PlacesBefore, 36 PlacesAfterwards, 122 TransitionsBefore, 27 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1554, independent: 1497, independent conditional: 1497, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1554, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1554, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1554, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1250, independent: 1209, independent conditional: 0, independent unconditional: 1209, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1250, independent: 1192, independent conditional: 0, independent unconditional: 1192, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 424, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 400, dependent conditional: 0, dependent unconditional: 400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1554, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1250, unknown conditional: 0, unknown unconditional: 1250] , Statistics on independence cache: Total cache size (in pairs): 1900, Positive cache size: 1859, Positive conditional cache size: 0, Positive unconditional cache size: 1859, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 44, 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: 64, independent: 44, independent conditional: 6, independent unconditional: 38, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 44, independent conditional: 6, independent unconditional: 38, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 6, independent unconditional: 38, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 43, independent conditional: 6, independent unconditional: 37, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 261, dependent conditional: 24, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 59, unknown conditional: 8, unknown unconditional: 51] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 43, Positive conditional cache size: 6, Positive unconditional cache size: 37, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 40, independent conditional: 40, 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: 58, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 18, dependent conditional: 3, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 58, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 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: 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: 58, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 49, Positive conditional cache size: 6, Positive unconditional cache size: 43, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 38, independent conditional: 38, 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: 56, independent: 38, independent conditional: 19, independent unconditional: 19, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 56, independent: 38, independent conditional: 0, independent unconditional: 38, 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: 26, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 69, Positive conditional cache size: 6, Positive unconditional cache size: 63, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 44, independent conditional: 8, independent unconditional: 36, dependent: 17, dependent conditional: 9, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 126, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 84, Positive conditional cache size: 6, Positive unconditional cache size: 78, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, 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.0s, 36 PlacesBefore, 36 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 88, independent conditional: 20, independent unconditional: 68, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 123, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 90, Positive conditional cache size: 6, Positive unconditional cache size: 84, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 42 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 92, independent conditional: 92, 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: 110, independent: 92, independent conditional: 64, independent unconditional: 28, 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: 110, independent: 92, independent conditional: 60, independent unconditional: 32, 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: 110, independent: 92, independent conditional: 60, independent unconditional: 32, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 90, independent conditional: 60, independent unconditional: 30, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 137, Positive conditional cache size: 6, Positive unconditional cache size: 131, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 20, 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: 28, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 20, independent conditional: 6, independent unconditional: 14, 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: 28, independent: 20, independent conditional: 6, independent unconditional: 14, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 28, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 138, Positive conditional cache size: 6, Positive unconditional cache size: 132, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 25, 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: 31, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 6, dependent conditional: 5, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 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] ], Cache Queries: [ total: 36, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 140, Positive conditional cache size: 6, Positive unconditional cache size: 134, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 46 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 24 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 30, 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: 34, independent: 30, independent conditional: 30, independent unconditional: 0, 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: 34, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 34, independent: 30, independent conditional: 22, independent unconditional: 8, 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: 4, independent: 4, independent conditional: 2, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 208, Positive conditional cache size: 8, Positive unconditional cache size: 200, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1988; [L849] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1988, ((void *)0), P0, ((void *)0))=9, t1988={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] 0 pthread_t t1989; [L851] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1989, ((void *)0), P1, ((void *)0))=10, t1988={7:0}, t1989={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 x$flush_delayed = weak$$choice2 [L790] EXPR 2 \read(x) [L790] 2 x$mem_tmp = x [L791] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] EXPR 2 \read(x) [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L793] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L794] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L795] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L796] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L797] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L800] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L801] EXPR 2 \read(x) [L801] 2 __unbuffered_p1_EAX = x [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] 2 x = x$flush_delayed ? x$mem_tmp : x [L803] 2 x$flush_delayed = (_Bool)0 [L806] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L852] 0 pthread_t t1990; [L853] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1990, ((void *)0), P2, ((void *)0))=11, t1988={7:0}, t1989={8:0}, t1990={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 __unbuffered_p0_EAX = y [L761] 1 x$w_buff1 = x$w_buff0 [L762] 1 x$w_buff0 = 1 [L763] 1 x$w_buff1_used = x$w_buff0_used [L764] 1 x$w_buff0_used = (_Bool)1 [L765] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L765] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 1 x$r_buff0_thd1 = (_Bool)1 [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L857] RET 3 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 3 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 3 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 3 \read(x) [L859] EXPR 3 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 3 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 3 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 3 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 3 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L866] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 3 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] EXPR 3 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 3 \read(*__unbuffered_p1_EAX$read_delayed_var) [L867] EXPR 3 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 3 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] 3 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L868] 3 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L870] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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, 151 locations, 6 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: 104.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 86.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 2 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 04:28:34,990 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...