/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/safe020_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:30:56,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:30:56,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:30:56,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:30:56,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:30:56,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:30:56,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:30:56,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:30:56,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:30:56,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:30:56,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:30:56,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:30:56,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:30:56,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:30:56,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:30:56,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:30:56,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:30:56,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:30:56,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:30:56,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:30:56,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:30:56,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:30:56,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:30:56,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:30:56,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:30:56,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:30:56,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:30:57,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:30:57,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:30:57,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:30:57,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:30:57,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:30:57,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:30:57,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:30:57,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:30:57,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:30:57,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:30:57,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:30:57,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:30:57,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:30:57,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:30:57,006 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:30:57,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:30:57,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:30:57,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:30:57,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:30:57,029 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:30:57,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:30:57,030 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:30:57,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:30:57,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:30:57,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:30:57,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:30:57,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:57,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:30:57,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:30:57,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:30:57,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:30:57,033 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:30:57,033 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:30:57,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:30:57,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:30:57,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:30:57,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:30:57,331 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:30:57,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2022-12-06 04:30:58,369 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:30:58,633 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:30:58,634 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2022-12-06 04:30:58,656 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db7aac21/dfa816940b4b4798999ee0e99c285cb0/FLAG04ab63aef [2022-12-06 04:30:58,667 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db7aac21/dfa816940b4b4798999ee0e99c285cb0 [2022-12-06 04:30:58,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:30:58,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:30:58,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:58,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:30:58,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:30:58,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:58" (1/1) ... [2022-12-06 04:30:58,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11866c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:58, skipping insertion in model container [2022-12-06 04:30:58,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:30:58" (1/1) ... [2022-12-06 04:30:58,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:30:58,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:30:58,863 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/safe020_power.i[990,1003] [2022-12-06 04:30:59,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:59,079 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:30:59,087 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/safe020_power.i[990,1003] [2022-12-06 04:30:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:30:59,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:30:59,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:30:59,194 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:30:59,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59 WrapperNode [2022-12-06 04:30:59,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:30:59,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:59,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:30:59,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:30:59,202 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:30:59" (1/1) ... [2022-12-06 04:30:59,242 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:30:59" (1/1) ... [2022-12-06 04:30:59,260 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-06 04:30:59,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:30:59,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:30:59,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:30:59,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:30:59,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:30:59,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:30:59,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:30:59,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:30:59,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (1/1) ... [2022-12-06 04:30:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:30:59,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:30:59,359 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:30:59,367 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:30:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:30:59,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:30:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:30:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:30:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:30:59,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:30:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:30:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:30:59,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:30:59,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:30:59,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:30:59,394 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:30:59,514 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:30:59,516 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:30:59,932 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:31:00,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:31:00,214 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:31:00,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:00 BoogieIcfgContainer [2022-12-06 04:31:00,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:31:00,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:31:00,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:31:00,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:31:00,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:30:58" (1/3) ... [2022-12-06 04:31:00,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d541f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:00, skipping insertion in model container [2022-12-06 04:31:00,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:30:59" (2/3) ... [2022-12-06 04:31:00,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d541f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:31:00, skipping insertion in model container [2022-12-06 04:31:00,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:31:00" (3/3) ... [2022-12-06 04:31:00,225 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-12-06 04:31:00,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:31:00,237 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:31:00,237 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:31:00,297 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:31:00,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:31:00,378 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:31:00,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:31:00,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 04:31:00,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-12-06 04:31:00,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:00,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2022-12-06 04:31:00,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2022-12-06 04:31:00,450 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 04:31:00,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:00,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:31:00,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2022-12-06 04:31:00,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-06 04:31:08,625 INFO L203 LiptonReduction]: Total number of compositions: 100 [2022-12-06 04:31:08,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:31:08,647 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;@5ef24bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:31:08,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:31:08,651 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 04:31:08,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:08,651 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:08,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:31:08,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 811570812, now seen corresponding path program 1 times [2022-12-06 04:31:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:08,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462987871] [2022-12-06 04:31:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:08,971 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:31:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462987871] [2022-12-06 04:31:08,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462987871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:08,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:08,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655969967] [2022-12-06 04:31:08,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:08,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 04:31:08,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:08,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:08,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 04:31:08,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:09,287 INFO L130 PetriNetUnfolder]: 1023/1532 cut-off events. [2022-12-06 04:31:09,287 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:31:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 1532 events. 1023/1532 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7114 event pairs, 168 based on Foata normal form. 0/1380 useless extension candidates. Maximal degree in co-relation 3096. Up to 1228 conditions per place. [2022-12-06 04:31:09,296 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 29 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 04:31:09,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 162 flow [2022-12-06 04:31:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 04:31:09,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 04:31:09,306 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 45 transitions. [2022-12-06 04:31:09,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 162 flow [2022-12-06 04:31:09,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:31:09,309 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 04:31:09,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 04:31:09,313 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:31:09,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:09,313 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 04:31:09,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:09,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:09,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 04:31:09,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 04:31:09,320 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:31:09,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:09,321 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 3. Compared 25 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:31:09,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 04:31:09,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 04:31:09,641 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:09,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-06 04:31:09,643 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:31:09,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:09,643 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:09,643 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:09,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:31:09,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 904463676, now seen corresponding path program 1 times [2022-12-06 04:31:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:09,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757214369] [2022-12-06 04:31:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:09,807 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:31:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:09,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757214369] [2022-12-06 04:31:09,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757214369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:09,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:09,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680879024] [2022-12-06 04:31:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:09,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:09,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:09,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:31:09,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:09,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:09,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:31:09,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:09,988 INFO L130 PetriNetUnfolder]: 689/1042 cut-off events. [2022-12-06 04:31:09,988 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-06 04:31:09,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1042 events. 689/1042 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4080 event pairs, 185 based on Foata normal form. 8/1050 useless extension candidates. Maximal degree in co-relation 2206. Up to 979 conditions per place. [2022-12-06 04:31:09,993 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 04:31:09,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 140 flow [2022-12-06 04:31:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:31:09,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2022-12-06 04:31:09,996 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:31:09,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 140 flow [2022-12-06 04:31:09,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:09,997 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:09,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-06 04:31:09,998 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -6 predicate places. [2022-12-06 04:31:09,998 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:09,998 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:09,999 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:09,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:09,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:09,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:10,005 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 04:31:10,005 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:31:10,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2022-12-06 04:31:10,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:10,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:31:10,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:10,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:31:10,036 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2022-12-06 04:31:10,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:10,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:31:10,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2026399018, now seen corresponding path program 1 times [2022-12-06 04:31:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567225086] [2022-12-06 04:31:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:10,190 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:31:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:10,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567225086] [2022-12-06 04:31:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567225086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:10,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:10,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:31:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537132415] [2022-12-06 04:31:10,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:10,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:10,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:10,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:10,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:10,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:10,383 INFO L130 PetriNetUnfolder]: 568/909 cut-off events. [2022-12-06 04:31:10,383 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-06 04:31:10,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 909 events. 568/909 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3633 event pairs, 155 based on Foata normal form. 12/921 useless extension candidates. Maximal degree in co-relation 2042. Up to 650 conditions per place. [2022-12-06 04:31:10,388 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 04:31:10,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 136 flow [2022-12-06 04:31:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 04:31:10,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:31:10,389 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 30 transitions. [2022-12-06 04:31:10,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 136 flow [2022-12-06 04:31:10,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:31:10,390 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:31:10,391 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 04:31:10,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:10,391 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:10,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:10,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,397 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 04:31:10,397 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:31:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2022-12-06 04:31:10,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 04:31:10,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:10,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 04:31:10,420 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2022-12-06 04:31:10,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:10,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:10,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:31:10,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2014290721, now seen corresponding path program 1 times [2022-12-06 04:31:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015799353] [2022-12-06 04:31:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:10,598 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:31:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:10,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015799353] [2022-12-06 04:31:10,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015799353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:10,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:10,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:31:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903022545] [2022-12-06 04:31:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:10,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:31:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:31:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:31:10,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:10,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:10,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:10,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:10,769 INFO L130 PetriNetUnfolder]: 466/775 cut-off events. [2022-12-06 04:31:10,769 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-06 04:31:10,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 775 events. 466/775 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3365 event pairs, 116 based on Foata normal form. 76/832 useless extension candidates. Maximal degree in co-relation 1828. Up to 308 conditions per place. [2022-12-06 04:31:10,773 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 38 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2022-12-06 04:31:10,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 224 flow [2022-12-06 04:31:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:31:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:31:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 04:31:10,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 04:31:10,774 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 4 states and 47 transitions. [2022-12-06 04:31:10,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 224 flow [2022-12-06 04:31:10,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:10,776 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 04:31:10,776 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-06 04:31:10,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:10,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:10,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:10,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,787 INFO L130 PetriNetUnfolder]: 27/77 cut-off events. [2022-12-06 04:31:10,787 INFO L131 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2022-12-06 04:31:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 77 events. 27/77 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 258 event pairs, 12 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 171. Up to 40 conditions per place. [2022-12-06 04:31:10,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 04:31:10,802 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:10,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:31:10,803 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 98 flow [2022-12-06 04:31:10,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:31:10,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:10,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:10,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:31:10,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -335320651, now seen corresponding path program 1 times [2022-12-06 04:31:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065674465] [2022-12-06 04:31:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:11,034 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:31:11,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:11,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065674465] [2022-12-06 04:31:11,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065674465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:11,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:11,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:31:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925698882] [2022-12-06 04:31:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:11,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:31:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:31:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:31:11,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:11,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 98 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:31:11,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:11,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:11,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:11,214 INFO L130 PetriNetUnfolder]: 229/418 cut-off events. [2022-12-06 04:31:11,215 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-06 04:31:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 418 events. 229/418 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1590 event pairs, 56 based on Foata normal form. 40/456 useless extension candidates. Maximal degree in co-relation 1201. Up to 172 conditions per place. [2022-12-06 04:31:11,217 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 45 selfloop transitions, 8 changer transitions 1/56 dead transitions. [2022-12-06 04:31:11,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 302 flow [2022-12-06 04:31:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:31:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:31:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 04:31:11,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6210526315789474 [2022-12-06 04:31:11,218 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 98 flow. Second operand 5 states and 59 transitions. [2022-12-06 04:31:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 302 flow [2022-12-06 04:31:11,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 292 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:31:11,220 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 04:31:11,235 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 04:31:11,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:11,236 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:11,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:11,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,245 INFO L130 PetriNetUnfolder]: 13/53 cut-off events. [2022-12-06 04:31:11,245 INFO L131 PetriNetUnfolder]: For 45/57 co-relation queries the response was YES. [2022-12-06 04:31:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 53 events. 13/53 cut-off events. For 45/57 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 3 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 147. Up to 25 conditions per place. [2022-12-06 04:31:11,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-06 04:31:11,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:31:11,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:31:11,264 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 138 flow [2022-12-06 04:31:11,264 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:31:11,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:11,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:11,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:31:11,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1655888238, now seen corresponding path program 1 times [2022-12-06 04:31:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:11,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556816610] [2022-12-06 04:31:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:11,510 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:31:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:11,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556816610] [2022-12-06 04:31:11,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556816610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:11,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:11,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:31:11,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180552790] [2022-12-06 04:31:11,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:11,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:31:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:31:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:31:11,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:31:11,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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:31:11,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:11,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:31:11,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:11,634 INFO L130 PetriNetUnfolder]: 150/281 cut-off events. [2022-12-06 04:31:11,634 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-12-06 04:31:11,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 281 events. 150/281 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 945 event pairs, 53 based on Foata normal form. 11/291 useless extension candidates. Maximal degree in co-relation 877. Up to 111 conditions per place. [2022-12-06 04:31:11,636 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 11 changer transitions 1/47 dead transitions. [2022-12-06 04:31:11,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 286 flow [2022-12-06 04:31:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 04:31:11,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-06 04:31:11,638 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 138 flow. Second operand 6 states and 51 transitions. [2022-12-06 04:31:11,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 286 flow [2022-12-06 04:31:11,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 253 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 04:31:11,641 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 146 flow [2022-12-06 04:31:11,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 04:31:11,641 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 04:31:11,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:11,642 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 146 flow [2022-12-06 04:31:11,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:11,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:11,643 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 146 flow [2022-12-06 04:31:11,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 146 flow [2022-12-06 04:31:11,649 INFO L130 PetriNetUnfolder]: 7/34 cut-off events. [2022-12-06 04:31:11,649 INFO L131 PetriNetUnfolder]: For 44/50 co-relation queries the response was YES. [2022-12-06 04:31:11,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 34 events. 7/34 cut-off events. For 44/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 49 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 94. Up to 13 conditions per place. [2022-12-06 04:31:11,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 146 flow [2022-12-06 04:31:11,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:31:11,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [823] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_19| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P0Thread1of1ForFork2_#res.offset_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_19|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [790] L864-3-->L867: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_57) 1 0) 0) 0 1) v_~main$tmp_guard0~0_24) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1] [2022-12-06 04:31:12,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L842-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.offset_11| 0) (= |v_P2Thread1of1ForFork1_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [829] L864-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_156 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_567 256) 0)) (.cse14 (not (= (mod v_~x$w_buff0_used~0_566 256) 0))) (.cse8 (not .cse0)) (.cse6 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd0~0_175 256) 0))) (let ((.cse5 (select |v_#memory_int_579| |v_~#x~0.base_293|)) (.cse2 (not .cse7)) (.cse4 (not .cse6)) (.cse13 (and .cse14 .cse8)) (.cse9 (not .cse1))) (and (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~mem39#1_171|))) (or (and (or .cse0 .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_141| |v_ULTIMATE.start_main_#t~ite40#1_170|) (or (and (= v_~x$w_buff1~0_323 |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse2 .cse3 .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~ite40#1_170|) (= |v_ULTIMATE.start_main_#t~mem39#1_169| (select .cse5 |v_~#x~0.offset_293|)) (or .cse6 .cse7)))) (and (= |v_ULTIMATE.start_main_#t~ite40#1_172| |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse8 .cse9 .cse3 (= |v_ULTIMATE.start_main_#t~ite41#1_141| v_~x$w_buff0~0_352)))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem43#1_176| |v_ULTIMATE.start_main_#t~mem43#1_174|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_91 256) 0))) (or (and (let ((.cse10 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse10) (= |v_ULTIMATE.start_main_#t~mem43#1_174| |v_ULTIMATE.start_main_#t~ite44#1_173|) (= (select (select |v_#memory_int_578| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94) |v_ULTIMATE.start_main_#t~mem43#1_174|)) (and .cse11 .cse10 (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_164)))) (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_163) (not .cse12)) (and (= |v_ULTIMATE.start_main_#t~ite44#1_175| |v_ULTIMATE.start_main_#t~ite44#1_173|) .cse11 .cse12 (= v_~__unbuffered_p2_EAX~0_164 v_~__unbuffered_p2_EAX~0_163)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= v_~x$r_buff0_thd0~0_155 (ite .cse13 0 v_~x$r_buff0_thd0~0_156)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~x$r_buff1_thd0~0_174 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_533 256) 0)) .cse2) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0)))) 0 v_~x$r_buff1_thd0~0_175)) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_163 1) (= v_~y~0_81 2) (= v_~__unbuffered_p0_EAX~0_103 0))) 1 0) 0) 0 1)) (= (store |v_#memory_int_579| |v_~#x~0.base_293| (store .cse5 |v_~#x~0.offset_293| |v_ULTIMATE.start_main_#t~ite41#1_141|)) |v_#memory_int_578|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| (mod v_~main$tmp_guard1~0_82 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite (or (and .cse2 .cse4) .cse13) 0 v_~x$w_buff1_used~0_534) v_~x$w_buff1_used~0_533) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_567) v_~x$w_buff0_used~0_566) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet42#1_117|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_352, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~#x~0.offset=|v_~#x~0.offset_293|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_176|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_117|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_175, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_567, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, #memory_int=|v_#memory_int_579|, ~#x~0.base=|v_~#x~0.base_293|, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_175|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_164, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_81, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_171|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_172|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_352, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_94|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, ~weak$$choice1~0=v_~weak$$choice1~0_150, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_140|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_163, ~y~0=v_~y~0_81, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_61|, ~#x~0.offset=|v_~#x~0.offset_293|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_174, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, #memory_int=|v_#memory_int_578|, ~#x~0.base=|v_~#x~0.base_293|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_141|, |v_ULTIMATE.start_main_#t~ite40#1_170|, |v_ULTIMATE.start_main_#t~mem39#1_169|, |v_ULTIMATE.start_main_#t~ite44#1_173|, |v_ULTIMATE.start_main_#t~mem43#1_174|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet38#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet42#1, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:31:13,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L806-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [829] L864-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_156 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_567 256) 0)) (.cse14 (not (= (mod v_~x$w_buff0_used~0_566 256) 0))) (.cse8 (not .cse0)) (.cse6 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd0~0_175 256) 0))) (let ((.cse5 (select |v_#memory_int_579| |v_~#x~0.base_293|)) (.cse2 (not .cse7)) (.cse4 (not .cse6)) (.cse13 (and .cse14 .cse8)) (.cse9 (not .cse1))) (and (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~mem39#1_171|))) (or (and (or .cse0 .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_141| |v_ULTIMATE.start_main_#t~ite40#1_170|) (or (and (= v_~x$w_buff1~0_323 |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse2 .cse3 .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~ite40#1_170|) (= |v_ULTIMATE.start_main_#t~mem39#1_169| (select .cse5 |v_~#x~0.offset_293|)) (or .cse6 .cse7)))) (and (= |v_ULTIMATE.start_main_#t~ite40#1_172| |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse8 .cse9 .cse3 (= |v_ULTIMATE.start_main_#t~ite41#1_141| v_~x$w_buff0~0_352)))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem43#1_176| |v_ULTIMATE.start_main_#t~mem43#1_174|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_91 256) 0))) (or (and (let ((.cse10 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse10) (= |v_ULTIMATE.start_main_#t~mem43#1_174| |v_ULTIMATE.start_main_#t~ite44#1_173|) (= (select (select |v_#memory_int_578| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94) |v_ULTIMATE.start_main_#t~mem43#1_174|)) (and .cse11 .cse10 (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_164)))) (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_163) (not .cse12)) (and (= |v_ULTIMATE.start_main_#t~ite44#1_175| |v_ULTIMATE.start_main_#t~ite44#1_173|) .cse11 .cse12 (= v_~__unbuffered_p2_EAX~0_164 v_~__unbuffered_p2_EAX~0_163)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= v_~x$r_buff0_thd0~0_155 (ite .cse13 0 v_~x$r_buff0_thd0~0_156)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~x$r_buff1_thd0~0_174 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_533 256) 0)) .cse2) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0)))) 0 v_~x$r_buff1_thd0~0_175)) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_163 1) (= v_~y~0_81 2) (= v_~__unbuffered_p0_EAX~0_103 0))) 1 0) 0) 0 1)) (= (store |v_#memory_int_579| |v_~#x~0.base_293| (store .cse5 |v_~#x~0.offset_293| |v_ULTIMATE.start_main_#t~ite41#1_141|)) |v_#memory_int_578|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| (mod v_~main$tmp_guard1~0_82 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite (or (and .cse2 .cse4) .cse13) 0 v_~x$w_buff1_used~0_534) v_~x$w_buff1_used~0_533) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_567) v_~x$w_buff0_used~0_566) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet42#1_117|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_352, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~#x~0.offset=|v_~#x~0.offset_293|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_176|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_117|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_175, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_567, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, #memory_int=|v_#memory_int_579|, ~#x~0.base=|v_~#x~0.base_293|, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_175|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_164, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_81, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_171|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_172|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_352, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_94|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, ~weak$$choice1~0=v_~weak$$choice1~0_150, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_140|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_163, ~y~0=v_~y~0_81, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_61|, ~#x~0.offset=|v_~#x~0.offset_293|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_174, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, #memory_int=|v_#memory_int_578|, ~#x~0.base=|v_~#x~0.base_293|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_141|, |v_ULTIMATE.start_main_#t~ite40#1_170|, |v_ULTIMATE.start_main_#t~mem39#1_169|, |v_ULTIMATE.start_main_#t~ite44#1_173|, |v_ULTIMATE.start_main_#t~mem43#1_174|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet38#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet42#1, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:31:14,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [823] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_19| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P0Thread1of1ForFork2_#res.offset_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_19|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [829] L864-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_156 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_567 256) 0)) (.cse14 (not (= (mod v_~x$w_buff0_used~0_566 256) 0))) (.cse8 (not .cse0)) (.cse6 (= (mod v_~x$w_buff1_used~0_534 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd0~0_175 256) 0))) (let ((.cse5 (select |v_#memory_int_579| |v_~#x~0.base_293|)) (.cse2 (not .cse7)) (.cse4 (not .cse6)) (.cse13 (and .cse14 .cse8)) (.cse9 (not .cse1))) (and (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~mem39#1_171|))) (or (and (or .cse0 .cse1) (= |v_ULTIMATE.start_main_#t~ite41#1_141| |v_ULTIMATE.start_main_#t~ite40#1_170|) (or (and (= v_~x$w_buff1~0_323 |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse2 .cse3 .cse4) (and (= |v_ULTIMATE.start_main_#t~mem39#1_169| |v_ULTIMATE.start_main_#t~ite40#1_170|) (= |v_ULTIMATE.start_main_#t~mem39#1_169| (select .cse5 |v_~#x~0.offset_293|)) (or .cse6 .cse7)))) (and (= |v_ULTIMATE.start_main_#t~ite40#1_172| |v_ULTIMATE.start_main_#t~ite40#1_170|) .cse8 .cse9 .cse3 (= |v_ULTIMATE.start_main_#t~ite41#1_141| v_~x$w_buff0~0_352)))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem43#1_176| |v_ULTIMATE.start_main_#t~mem43#1_174|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_91 256) 0))) (or (and (let ((.cse10 (= (mod v_~weak$$choice1~0_150 256) 0))) (or (and (not .cse10) (= |v_ULTIMATE.start_main_#t~mem43#1_174| |v_ULTIMATE.start_main_#t~ite44#1_173|) (= (select (select |v_#memory_int_578| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94) |v_ULTIMATE.start_main_#t~mem43#1_174|)) (and .cse11 .cse10 (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_164)))) (= |v_ULTIMATE.start_main_#t~ite44#1_173| v_~__unbuffered_p2_EAX~0_163) (not .cse12)) (and (= |v_ULTIMATE.start_main_#t~ite44#1_175| |v_ULTIMATE.start_main_#t~ite44#1_173|) .cse11 .cse12 (= v_~__unbuffered_p2_EAX~0_164 v_~__unbuffered_p2_EAX~0_163)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= v_~x$r_buff0_thd0~0_155 (ite .cse13 0 v_~x$r_buff0_thd0~0_156)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= v_~x$r_buff1_thd0~0_174 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_533 256) 0)) .cse2) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_155 256) 0)))) 0 v_~x$r_buff1_thd0~0_175)) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_163 1) (= v_~y~0_81 2) (= v_~__unbuffered_p0_EAX~0_103 0))) 1 0) 0) 0 1)) (= (store |v_#memory_int_579| |v_~#x~0.base_293| (store .cse5 |v_~#x~0.offset_293| |v_ULTIMATE.start_main_#t~ite41#1_141|)) |v_#memory_int_578|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| (mod v_~main$tmp_guard1~0_82 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|) (= (ite (or (and .cse2 .cse4) .cse13) 0 v_~x$w_buff1_used~0_534) v_~x$w_buff1_used~0_533) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_567) v_~x$w_buff0_used~0_566) (= v_~weak$$choice1~0_150 |v_ULTIMATE.start_main_#t~nondet42#1_117|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_352, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~#x~0.offset=|v_~#x~0.offset_293|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_176|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_117|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_175, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_567, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, #memory_int=|v_#memory_int_579|, ~#x~0.base=|v_~#x~0.base_293|, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_175|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_164, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_81, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_171|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_172|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_352, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_94|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_94, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, ~weak$$choice1~0=v_~weak$$choice1~0_150, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_140|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_163, ~y~0=v_~y~0_81, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_155, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_61|, ~#x~0.offset=|v_~#x~0.offset_293|, ~x$w_buff1~0=v_~x$w_buff1~0_323, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_533, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_174, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, #memory_int=|v_#memory_int_578|, ~#x~0.base=|v_~#x~0.base_293|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_53|} AuxVars[|v_ULTIMATE.start_main_#t~ite41#1_141|, |v_ULTIMATE.start_main_#t~ite40#1_170|, |v_ULTIMATE.start_main_#t~mem39#1_169|, |v_ULTIMATE.start_main_#t~ite44#1_173|, |v_ULTIMATE.start_main_#t~mem43#1_174|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet38#1, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet42#1, ~x$w_buff0_used~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:31:15,172 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:31:15,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3531 [2022-12-06 04:31:15,173 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 132 flow [2022-12-06 04:31:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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:31:15,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:15,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:15,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:31:15,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1772190748, now seen corresponding path program 1 times [2022-12-06 04:31:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:15,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826737346] [2022-12-06 04:31:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:15,387 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:31:15,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:15,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826737346] [2022-12-06 04:31:15,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826737346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:15,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:15,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:31:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565880953] [2022-12-06 04:31:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:15,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:31:15,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:15,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:31:15,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:31:15,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:31:15,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 132 flow. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:31:15,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:15,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:31:15,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:15,487 INFO L130 PetriNetUnfolder]: 182/338 cut-off events. [2022-12-06 04:31:15,487 INFO L131 PetriNetUnfolder]: For 457/457 co-relation queries the response was YES. [2022-12-06 04:31:15,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 338 events. 182/338 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1270 event pairs, 105 based on Foata normal form. 3/341 useless extension candidates. Maximal degree in co-relation 1037. Up to 239 conditions per place. [2022-12-06 04:31:15,489 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 04:31:15,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 244 flow [2022-12-06 04:31:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:31:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:31:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 04:31:15,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:31:15,491 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 132 flow. Second operand 3 states and 30 transitions. [2022-12-06 04:31:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 244 flow [2022-12-06 04:31:15,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 174 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:31:15,495 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 86 flow [2022-12-06 04:31:15,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:31:15,496 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:31:15,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:15,496 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 86 flow [2022-12-06 04:31:15,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:15,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:15,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 86 flow [2022-12-06 04:31:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 86 flow [2022-12-06 04:31:15,507 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 04:31:15,507 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 04:31:15,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 23 events. 3/23 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 43. Up to 5 conditions per place. [2022-12-06 04:31:15,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 86 flow [2022-12-06 04:31:15,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 04:31:17,052 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:31:17,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1556 [2022-12-06 04:31:17,053 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 82 flow [2022-12-06 04:31:17,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 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:31:17,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:17,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:17,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:31:17,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:17,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1869148600, now seen corresponding path program 1 times [2022-12-06 04:31:17,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:17,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827542648] [2022-12-06 04:31:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:17,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:31:18,562 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:31:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:31:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827542648] [2022-12-06 04:31:18,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827542648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:31:18,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:31:18,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:31:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893673876] [2022-12-06 04:31:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:31:18,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:31:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:31:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:31:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:31:18,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:31:18,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 82 flow. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:31:18,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:31:18,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:31:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:31:18,777 INFO L130 PetriNetUnfolder]: 72/165 cut-off events. [2022-12-06 04:31:18,777 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-06 04:31:18,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 165 events. 72/165 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 667 event pairs, 9 based on Foata normal form. 3/168 useless extension candidates. Maximal degree in co-relation 487. Up to 63 conditions per place. [2022-12-06 04:31:18,778 INFO L137 encePairwiseOnDemand]: 7/17 looper letters, 39 selfloop transitions, 6 changer transitions 9/54 dead transitions. [2022-12-06 04:31:18,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 54 transitions, 343 flow [2022-12-06 04:31:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:31:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:31:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 04:31:18,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2022-12-06 04:31:18,780 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 82 flow. Second operand 6 states and 49 transitions. [2022-12-06 04:31:18,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 54 transitions, 343 flow [2022-12-06 04:31:18,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 54 transitions, 298 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-06 04:31:18,782 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 110 flow [2022-12-06 04:31:18,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 04:31:18,782 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 04:31:18,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:31:18,783 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 110 flow [2022-12-06 04:31:18,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:31:18,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:31:18,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 110 flow [2022-12-06 04:31:18,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 110 flow [2022-12-06 04:31:18,795 INFO L130 PetriNetUnfolder]: 13/62 cut-off events. [2022-12-06 04:31:18,795 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-06 04:31:18,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 62 events. 13/62 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 3 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 146. Up to 19 conditions per place. [2022-12-06 04:31:18,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 110 flow [2022-12-06 04:31:18,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 04:31:32,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L799: Formula: (and (= v_~x$r_buff0_thd2~0_77 1) (= v_~x$r_buff1_thd1~0_82 v_~x$r_buff0_thd1~0_77) (= v_~x$w_buff0_used~0_322 v_~x$w_buff1_used~0_299) (= v_~x$w_buff0~0_187 v_~x$w_buff1~0_173) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_321 256) 0)) (not (= (mod v_~x$w_buff1_used~0_299 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd2~0_60 v_~x$r_buff0_thd2~0_78) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_80 v_~x$r_buff0_thd0~0_70) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_143) (= v_~x$w_buff0~0_186 1) (= v_~x$w_buff0_used~0_321 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_187, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_186, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_173, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_143, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_82, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_321, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [833] $Ultimate##0-->L835: Formula: (let ((.cse1 (mod v_~x$w_buff0_used~0_595 256)) (.cse10 (mod v_~weak$$choice0~0_157 256)) (.cse7 (= (mod v_~x$r_buff0_thd3~0_257 256) 0)) (.cse21 (= (mod v_~x$w_buff0_used~0_594 256) 0))) (let ((.cse26 (= (mod v_~weak$$choice2~0_149 256) 0)) (.cse20 (select |v_#memory_int_605| |v_~#x~0.base_305|)) (.cse18 (= (mod v_~x$w_buff1_used~0_561 256) 0)) (.cse24 (not .cse21)) (.cse4 (not .cse7)) (.cse19 (= .cse10 0)) (.cse2 (= .cse1 0))) (let ((.cse3 (not .cse2)) (.cse9 (= (mod v_~weak$$choice1~0_160 256) 0)) (.cse23 (not (= (mod v_~x$w_buff1_used~0_560 256) 0))) (.cse8 (not .cse19)) (.cse22 (and .cse24 .cse4)) (.cse5 (= (mod v_~x$r_buff1_thd3~0_252 256) 0)) (.cse6 (not .cse18)) (.cse14 (select .cse20 |v_~#x~0.offset_305|)) (.cse0 (not .cse26))) (and (= (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse3 .cse5 .cse6 .cse7) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1) v_~x$w_buff0_used~0_594) (= v_~__unbuffered_p2_EAX$read_delayed~0_101 1) (let ((.cse17 (= |v_P2_#t~ite24_78| |v_P2Thread1of1ForFork1_#t~ite24_50|)) (.cse12 (= |v_P2_#t~ite20_86| |v_P2Thread1of1ForFork1_#t~ite20_50|)) (.cse11 (= |v_P2_#t~ite22_92| |v_P2Thread1of1ForFork1_#t~ite22_50|)) (.cse13 (= |v_P2Thread1of1ForFork1_#t~mem21_50| |v_P2_#t~mem21_95|)) (.cse15 (= |v_P2_#t~ite23_86| |v_P2Thread1of1ForFork1_#t~ite23_50|)) (.cse16 (= |v_P2Thread1of1ForFork1_#t~mem19_50| |v_P2_#t~mem19_89|))) (or (and .cse11 .cse12 .cse13 (= .cse14 |v_P2_#t~mem18_61|) (= |v_P2_#t~mem18_61| v_~__unbuffered_p2_EAX~0_181) .cse15 .cse2 .cse16 .cse17 (= |v_P2_#t~ite25_68| |v_P2Thread1of1ForFork1_#t~ite25_50|)) (and .cse3 (or (and .cse11 .cse12 .cse13 (= |v_P2_#t~ite25_68| v_~x$w_buff0~0_371) .cse15 .cse16 .cse17 .cse4) (and (= |v_P2_#t~ite24_78| |v_P2_#t~ite25_68|) (or (and (= |v_P2_#t~ite24_78| |v_P2_#t~ite23_86|) .cse12 .cse16 (or (not .cse5) .cse18) (or (and (= |v_P2_#t~ite22_92| |v_P2_#t~ite23_86|) .cse18 (or (and .cse8 .cse13 (= |v_P2_#t~ite22_92| v_~x$w_buff0~0_371)) (and (= |v_P2_#t~ite22_92| |v_P2_#t~mem21_95|) (= .cse14 |v_P2_#t~mem21_95|) .cse19))) (and (= |v_P2_#t~ite23_86| (ite .cse8 v_~x$w_buff1~0_341 v_~x$w_buff0~0_371)) .cse11 .cse13 .cse6))) (and .cse11 .cse13 .cse15 .cse5 (= |v_P2_#t~ite20_86| |v_P2_#t~ite24_78|) .cse6 (or (and .cse16 (= |v_P2_#t~ite20_86| (ite (not .cse9) v_~x$w_buff0~0_371 v_~x$w_buff1~0_341)) .cse19) (and .cse8 (= .cse14 |v_P2_#t~mem19_89|) (= |v_P2_#t~ite20_86| |v_P2_#t~mem19_89|))))) .cse7)) (= |v_P2Thread1of1ForFork1_#t~mem18_50| |v_P2_#t~mem18_61|) (= |v_P2_#t~ite25_68| v_~__unbuffered_p2_EAX~0_181)))) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104 |v_~#x~0.base_305|) (= |v_#memory_int_604| (store |v_#memory_int_605| |v_~#x~0.base_305| (store .cse20 |v_~#x~0.offset_305| |v_P2_#t~ite29_58|))) (= v_~x$r_buff0_thd3~0_256 (ite .cse0 v_~x$r_buff0_thd3~0_257 (ite .cse21 v_~x$r_buff0_thd3~0_257 (ite .cse22 0 (ite (and .cse23 .cse5 .cse24 .cse7) v_~x$r_buff0_thd3~0_257 0))))) (= v_~y~0_89 1) (= (ite .cse0 v_~x$r_buff1_thd3~0_252 (ite .cse21 v_~x$r_buff1_thd3~0_252 (let ((.cse25 (= (mod v_~x$r_buff0_thd3~0_256 256) 0))) (ite (and .cse24 (not .cse25)) 0 (ite (and .cse25 .cse23 .cse5 .cse24) (ite .cse8 v_~x$r_buff1_thd3~0_252 0) 0))))) v_~x$r_buff1_thd3~0_251) (= v_~weak$$choice1~0_160 |v_P2Thread1of1ForFork1_#t~nondet17_50|) (= v_~x$w_buff1~0_341 v_~x$w_buff1~0_340) (= v_~weak$$choice2~0_149 |v_P2Thread1of1ForFork1_#t~nondet15_50|) (= v_~x$w_buff1_used~0_560 (ite .cse0 v_~x$w_buff1_used~0_561 (ite .cse21 v_~x$w_buff1_used~0_561 (ite .cse22 0 (ite (and .cse5 .cse24 .cse6 .cse7) v_~weak$$choice0~0_157 0))))) (= |v_~#x~0.offset_305| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104) (= .cse14 v_~x$mem_tmp~0_109) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (or (and .cse26 (= |v_P2_#t~ite29_58| |v_P2_#t~mem28_59|) (= |v_P2_#t~mem28_59| v_~__unbuffered_p2_EAX~0_181)) (and (= |v_P2Thread1of1ForFork1_#t~mem28_50| |v_P2_#t~mem28_59|) .cse0 (= |v_P2_#t~ite29_58| v_~x$mem_tmp~0_109))) (= v_~x$flush_delayed~0_135 0) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~x$w_buff0~0_371 v_~x$w_buff0~0_370) (= |v_P2Thread1of1ForFork1_#t~nondet14_50| v_~weak$$choice0~0_157))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_371, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_50|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_50|, ~#x~0.offset=|v_~#x~0.offset_305|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_50|, ~x$w_buff1~0=v_~x$w_buff1~0_341, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_50|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_252, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_257, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_595, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_50|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_50|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_50|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_50|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_50|, #memory_int=|v_#memory_int_605|, ~#x~0.base=|v_~#x~0.base_305|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_50|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_370, ~x$flush_delayed~0=v_~x$flush_delayed~0_135, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_27|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_251, ~x$mem_tmp~0=v_~x$mem_tmp~0_109, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_256, ~weak$$choice1~0=v_~weak$$choice1~0_160, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_27|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_181, ~y~0=v_~y~0_89, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_27|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~#x~0.offset=|v_~#x~0.offset_305|, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_27|, ~x$w_buff1~0=v_~x$w_buff1~0_340, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_594, ~weak$$choice0~0=v_~weak$$choice0~0_157, #memory_int=|v_#memory_int_604|, ~#x~0.base=|v_~#x~0.base_305|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_149} AuxVars[|v_P2_#t~mem18_61|, |v_P2_#t~ite23_86|, |v_P2_#t~ite24_78|, |v_P2_#t~ite25_68|, |v_P2_#t~ite20_86|, |v_P2_#t~mem28_59|, |v_P2_#t~mem19_89|, |v_P2_#t~ite29_58|, |v_P2_#t~mem21_95|, |v_P2_#t~ite22_92|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, P2Thread1of1ForFork1_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0] [2022-12-06 04:31:34,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->L799: Formula: (and (= v_~x$r_buff0_thd2~0_77 1) (= v_~x$r_buff1_thd1~0_82 v_~x$r_buff0_thd1~0_77) (= v_~x$w_buff0_used~0_322 v_~x$w_buff1_used~0_299) (= v_~x$w_buff0~0_187 v_~x$w_buff1~0_173) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_321 256) 0)) (not (= (mod v_~x$w_buff1_used~0_299 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd2~0_60 v_~x$r_buff0_thd2~0_78) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_80 v_~x$r_buff0_thd0~0_70) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd3~0_149 v_~x$r_buff1_thd3~0_143) (= v_~x$w_buff0~0_186 1) (= v_~x$w_buff0_used~0_321 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_187, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_186, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_173, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_143, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_299, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_82, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_321, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [701] L835-->L842: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (not .cse7)) (.cse8 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= 0 (mod v_~x$r_buff1_thd3~0_74 256))) (.cse9 (= (mod v_~x$w_buff1_used~0_204 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (select |v_#memory_int_219| |v_~#x~0.base_148|)) (.cse1 (not .cse10)) (.cse4 (not .cse8)) (.cse0 (and .cse11 .cse6))) (and (= v_~x$w_buff1_used~0_203 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_204)) (= |v_#memory_int_218| (store |v_#memory_int_219| |v_~#x~0.base_148| (store .cse3 |v_~#x~0.offset_148| |v_P2_#t~ite32_27|))) (let ((.cse5 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_98) .cse4 .cse5 (= |v_P2_#t~ite31_27| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse6) (and (= |v_P2_#t~ite31_27| |v_P2_#t~ite32_27|) (or .cse7 .cse8) (or (and .cse5 (= |v_P2_#t~ite31_27| v_~x$w_buff1~0_101) .cse1 .cse2) (and (= |v_P2_#t~ite31_27| |v_P2_#t~mem30_30|) (= (select .cse3 |v_~#x~0.offset_148|) |v_P2_#t~mem30_30|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd3~0_73 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 0 v_~x$r_buff1_thd3~0_74)) (= (ite (and .cse4 .cse6) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_78) v_~x$r_buff0_thd3~0_77))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~#x~0.offset=|v_~#x~0.offset_148|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_219|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_148|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_P2_#t~ite31_27|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 04:31:34,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:31:34,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15866 [2022-12-06 04:31:34,648 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 112 flow [2022-12-06 04:31:34,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:31:34,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:31:34,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:34,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:31:34,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:31:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:31:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1911886787, now seen corresponding path program 1 times [2022-12-06 04:31:34,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:31:34,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543166302] [2022-12-06 04:31:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:31:34,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:31:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:31:34,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:31:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:31:34,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:31:34,824 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:31:34,824 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:31:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:31:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:31:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:31:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:31:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:31:34,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:31:34,827 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:31:34,830 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:31:34,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:31:34,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:31:34 BasicIcfg [2022-12-06 04:31:34,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:31:34,904 INFO L158 Benchmark]: Toolchain (without parser) took 36234.90ms. Allocated memory was 184.5MB in the beginning and 929.0MB in the end (delta: 744.5MB). Free memory was 158.7MB in the beginning and 345.2MB in the end (delta: -186.5MB). Peak memory consumption was 559.5MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.87ms. Allocated memory is still 184.5MB. Free memory was 158.1MB in the beginning and 130.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.73ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: Boogie Preprocessor took 56.09ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: RCFGBuilder took 900.31ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 125.1MB in the beginning and 178.7MB in the end (delta: -53.6MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,905 INFO L158 Benchmark]: TraceAbstraction took 34684.87ms. Allocated memory was 224.4MB in the beginning and 929.0MB in the end (delta: 704.6MB). Free memory was 178.2MB in the beginning and 345.2MB in the end (delta: -167.0MB). Peak memory consumption was 538.2MB. Max. memory is 8.0GB. [2022-12-06 04:31:34,906 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.10ms. Allocated memory is still 184.5MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.87ms. Allocated memory is still 184.5MB. Free memory was 158.1MB in the beginning and 130.3MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.73ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 127.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.09ms. Allocated memory is still 184.5MB. Free memory was 127.7MB in the beginning and 125.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 900.31ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 125.1MB in the beginning and 178.7MB in the end (delta: -53.6MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. * TraceAbstraction took 34684.87ms. Allocated memory was 224.4MB in the beginning and 929.0MB in the end (delta: 704.6MB). Free memory was 178.2MB in the beginning and 345.2MB in the end (delta: -167.0MB). Peak memory consumption was 538.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 129 PlacesBefore, 35 PlacesAfterwards, 121 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1277, independent: 1233, independent conditional: 1233, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1277, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1277, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1277, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1024, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1024, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1277, independent: 240, independent conditional: 0, independent unconditional: 240, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1024, unknown conditional: 0, unknown unconditional: 1024] , Statistics on independence cache: Total cache size (in pairs): 1632, Positive cache size: 1601, Positive conditional cache size: 0, Positive unconditional cache size: 1601, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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, 28 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 115, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 115, independent: 78, independent conditional: 9, independent unconditional: 69, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 115, independent: 78, independent conditional: 9, independent unconditional: 69, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 115, independent: 78, independent conditional: 9, independent unconditional: 69, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, independent: 44, independent conditional: 5, independent unconditional: 39, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 168, dependent conditional: 8, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, independent: 34, independent conditional: 4, independent unconditional: 30, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 64, unknown conditional: 6, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 45, Positive conditional cache size: 5, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, 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, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 5, independent unconditional: 30, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 55, Positive conditional cache size: 5, Positive unconditional cache size: 50, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, 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.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 8, independent unconditional: 22, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 55, Positive conditional cache size: 5, Positive unconditional cache size: 50, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 59, Positive conditional cache size: 5, Positive unconditional cache size: 54, Negative cache size: 25, Negative conditional cache size: 1, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 23, independent conditional: 20, independent unconditional: 3, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 23, independent conditional: 8, independent unconditional: 15, 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: 41, independent: 23, independent conditional: 8, independent unconditional: 15, 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: 4, independent: 3, independent conditional: 2, 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: 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: 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 62, Positive conditional cache size: 7, Positive unconditional cache size: 55, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 40 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 23 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 41, independent conditional: 33, independent unconditional: 8, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 41, independent conditional: 19, independent unconditional: 22, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 41, independent conditional: 19, independent unconditional: 22, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 74, Positive conditional cache size: 16, Positive unconditional cache size: 58, Negative cache size: 27, Negative conditional cache size: 1, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 32 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 43, independent conditional: 42, independent unconditional: 1, dependent: 25, dependent conditional: 7, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 43, independent conditional: 28, independent unconditional: 15, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 35, independent conditional: 26, independent unconditional: 9, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 16, unknown conditional: 2, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 90, Positive conditional cache size: 19, Positive unconditional cache size: 71, Negative cache size: 35, Negative conditional cache size: 1, Negative unconditional cache size: 34, 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: 15.9s, 32 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 37, independent: 30, independent conditional: 28, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37, independent: 30, independent conditional: 28, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, 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: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, independent: 26, independent conditional: 24, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 104, Positive conditional cache size: 26, Positive unconditional cache size: 78, Negative cache size: 37, Negative conditional cache size: 1, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2257, ((void *)0), P0, ((void *)0))=-1, t2257={6: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] [L861] 0 pthread_t t2258; [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2258, ((void *)0), P1, ((void *)0))=0, t2257={6:0}, t2258={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] [L863] 0 pthread_t t2259; [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2259, ((void *)0), P2, ((void *)0))=1, t2257={6:0}, t2258={7:0}, t2259={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L759] 1 y = 2 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L837] 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) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] 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) [L837] 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) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 [L801] 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) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L866] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L868] RET 2 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 2 \read(x) [L870] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L877] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 2 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 2 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 2 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 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: 34.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 2 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=6, InterpolantAutomatonStates: 33, 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.6s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:31:34,940 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...