/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:45:10,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:45:10,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:45:10,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:45:10,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:45:10,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:45:10,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:45:10,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:45:10,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:45:10,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:45:10,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:45:10,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:45:10,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:45:10,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:45:10,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:45:10,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:45:10,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:45:10,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:45:10,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:45:10,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:45:10,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:45:11,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:45:11,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:45:11,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:45:11,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:45:11,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:45:11,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:45:11,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:45:11,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:45:11,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:45:11,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:45:11,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:45:11,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:45:11,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:45:11,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:45:11,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:45:11,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:45:11,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:45:11,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:45:11,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:45:11,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:45:11,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:45:11,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:45:11,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:45:11,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:45:11,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:45:11,059 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:45:11,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:45:11,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:45:11,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:45:11,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:45:11,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:45:11,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:45:11,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:45:11,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:45:11,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:45:11,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:45:11,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:45:11,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:45:11,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:45:11,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:45:11,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:45:11,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:45:11,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:11,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:45:11,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:45:11,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:45:11,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:45:11,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:45:11,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:45:11,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:45:11,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:45:11,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:45:11,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:45:11,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:45:11,406 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:45:11,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-13 00:45:12,592 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:45:12,882 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:45:12,883 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2022-12-13 00:45:12,905 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2bf8bc2/28aca493c5a94b38b926343b69760eaf/FLAG698c71f61 [2022-12-13 00:45:12,920 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2bf8bc2/28aca493c5a94b38b926343b69760eaf [2022-12-13 00:45:12,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:45:12,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:45:12,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:12,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:45:12,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:45:12,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:12" (1/1) ... [2022-12-13 00:45:12,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e526fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:12, skipping insertion in model container [2022-12-13 00:45:12,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:45:12" (1/1) ... [2022-12-13 00:45:12,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:45:12,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:45:13,132 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/mix052_tso.oepc.i[949,962] [2022-12-13 00:45:13,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:13,383 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:45:13,396 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/mix052_tso.oepc.i[949,962] [2022-12-13 00:45:13,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:45:13,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:45:13,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:45:13,499 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:45:13,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13 WrapperNode [2022-12-13 00:45:13,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:45:13,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:13,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:45:13,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:45:13,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,577 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 00:45:13,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:45:13,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:45:13,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:45:13,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:45:13,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:45:13,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:45:13,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:45:13,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:45:13,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (1/1) ... [2022-12-13 00:45:13,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:45:13,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:45:13,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:45:13,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:45:13,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:45:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:45:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:45:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:45:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:45:13,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:45:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:45:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:45:13,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:45:13,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:45:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:45:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:45:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:45:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:45:13,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:45:13,714 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:45:13,893 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:45:13,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:45:14,111 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:45:14,277 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:45:14,277 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:45:14,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:14 BoogieIcfgContainer [2022-12-13 00:45:14,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:45:14,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:45:14,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:45:14,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:45:14,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:45:12" (1/3) ... [2022-12-13 00:45:14,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144e0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:14, skipping insertion in model container [2022-12-13 00:45:14,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:45:13" (2/3) ... [2022-12-13 00:45:14,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144e0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:45:14, skipping insertion in model container [2022-12-13 00:45:14,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:45:14" (3/3) ... [2022-12-13 00:45:14,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2022-12-13 00:45:14,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:45:14,307 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:45:14,307 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:45:14,388 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:45:14,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:45:14,481 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:45:14,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:45:14,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:45:14,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 00:45:14,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:14,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:45:14,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 00:45:14,566 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:45:14,567 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:45:14,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:45:14,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-13 00:45:23,638 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 00:45:23,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:45:23,657 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;@21c649e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:45:23,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:45:23,660 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 00:45:23,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:23,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:23,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:45:23,661 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-13 00:45:23,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 467978769, now seen corresponding path program 1 times [2022-12-13 00:45:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523065060] [2022-12-13 00:45:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523065060] [2022-12-13 00:45:24,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523065060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:24,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:24,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:45:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778709261] [2022-12-13 00:45:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:24,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:24,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-13 00:45:24,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:24,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:24,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-13 00:45:24,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:25,873 INFO L130 PetriNetUnfolder]: 7924/12462 cut-off events. [2022-12-13 00:45:25,873 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:45:25,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23864 conditions, 12462 events. 7924/12462 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 87856 event pairs, 2218 based on Foata normal form. 0/7559 useless extension candidates. Maximal degree in co-relation 23853. Up to 9597 conditions per place. [2022-12-13 00:45:25,924 INFO L137 encePairwiseOnDemand]: 56/60 looper letters, 32 selfloop transitions, 2 changer transitions 52/97 dead transitions. [2022-12-13 00:45:25,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 378 flow [2022-12-13 00:45:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-13 00:45:25,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 00:45:25,938 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 129 flow. Second operand 3 states and 122 transitions. [2022-12-13 00:45:25,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 378 flow [2022-12-13 00:45:25,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:25,943 INFO L231 Difference]: Finished difference. Result has 67 places, 32 transitions, 74 flow [2022-12-13 00:45:25,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=67, PETRI_TRANSITIONS=32} [2022-12-13 00:45:25,948 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 00:45:25,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:25,949 INFO L89 Accepts]: Start accepts. Operand has 67 places, 32 transitions, 74 flow [2022-12-13 00:45:25,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:25,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:25,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 32 transitions, 74 flow [2022-12-13 00:45:25,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:45:25,960 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:45:25,961 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:25,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 82 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:45:25,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:45:25,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 00:45:26,100 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:26,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 00:45:26,102 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:45:26,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:26,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:26,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:26,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:45:26,106 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-13 00:45:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1423142085, now seen corresponding path program 1 times [2022-12-13 00:45:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4960385] [2022-12-13 00:45:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:26,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4960385] [2022-12-13 00:45:26,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4960385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:26,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:26,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585346999] [2022-12-13 00:45:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:26,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:26,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:26,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:45:26,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:26,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:26,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:45:26,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:26,930 INFO L130 PetriNetUnfolder]: 1391/2290 cut-off events. [2022-12-13 00:45:26,930 INFO L131 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2022-12-13 00:45:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 2290 events. 1391/2290 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12719 event pairs, 423 based on Foata normal form. 10/1935 useless extension candidates. Maximal degree in co-relation 4534. Up to 1982 conditions per place. [2022-12-13 00:45:26,942 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 32 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 00:45:26,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 176 flow [2022-12-13 00:45:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 00:45:26,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 00:45:26,944 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 66 transitions. [2022-12-13 00:45:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 176 flow [2022-12-13 00:45:26,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:26,945 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2022-12-13 00:45:26,946 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2022-12-13 00:45:26,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:26,947 INFO L89 Accepts]: Start accepts. Operand has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:26,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:26,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,953 INFO L130 PetriNetUnfolder]: 3/48 cut-off events. [2022-12-13 00:45:26,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:45:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 48 events. 3/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 152 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 61. Up to 10 conditions per place. [2022-12-13 00:45:26,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 00:45:26,988 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:26,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 00:45:26,989 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 89 flow [2022-12-13 00:45:26,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:26,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:26,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:45:26,990 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-13 00:45:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1167730840, now seen corresponding path program 1 times [2022-12-13 00:45:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:26,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692623072] [2022-12-13 00:45:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:27,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692623072] [2022-12-13 00:45:27,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692623072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:27,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:27,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377955645] [2022-12-13 00:45:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:27,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:27,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:45:27,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:27,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:27,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:45:27,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:28,136 INFO L130 PetriNetUnfolder]: 1399/2273 cut-off events. [2022-12-13 00:45:28,136 INFO L131 PetriNetUnfolder]: For 295/295 co-relation queries the response was YES. [2022-12-13 00:45:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4836 conditions, 2273 events. 1399/2273 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11916 event pairs, 681 based on Foata normal form. 6/1915 useless extension candidates. Maximal degree in co-relation 4825. Up to 1974 conditions per place. [2022-12-13 00:45:28,152 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 42 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 00:45:28,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 265 flow [2022-12-13 00:45:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 00:45:28,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-13 00:45:28,154 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 89 flow. Second operand 5 states and 102 transitions. [2022-12-13 00:45:28,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 265 flow [2022-12-13 00:45:28,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:28,156 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 158 flow [2022-12-13 00:45:28,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-12-13 00:45:28,157 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2022-12-13 00:45:28,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:28,157 INFO L89 Accepts]: Start accepts. Operand has 48 places, 43 transitions, 158 flow [2022-12-13 00:45:28,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:28,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:28,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 43 transitions, 158 flow [2022-12-13 00:45:28,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 158 flow [2022-12-13 00:45:28,169 INFO L130 PetriNetUnfolder]: 16/113 cut-off events. [2022-12-13 00:45:28,170 INFO L131 PetriNetUnfolder]: For 34/49 co-relation queries the response was YES. [2022-12-13 00:45:28,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 113 events. 16/113 cut-off events. For 34/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 564 event pairs, 5 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 192. Up to 22 conditions per place. [2022-12-13 00:45:28,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 158 flow [2022-12-13 00:45:28,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 742 [2022-12-13 00:45:28,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:28,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [334] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_117 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_61 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_90))) (= v_~x$w_buff0_used~0_135 (ite .cse0 0 v_~x$w_buff0_used~0_136)) (= v_~x$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_117)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_116 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:28,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L773: Formula: (and (= v_~x$w_buff0_used~0_311 1) (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_275 256) 0)) (not (= (mod v_~x$w_buff0_used~0_311 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0_used~0_312 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0~0_200 v_~x$w_buff1~0_175) (= v_~x$r_buff1_thd3~0_90 v_~x$r_buff0_thd3~0_95) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |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_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_167) (= 2 v_~x$w_buff0~0_199)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_200, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, 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_175, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_311, 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 [485] L744-->L783: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_135 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_654 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_100 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_603 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_655 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_440 (ite .cse1 v_~x$w_buff1~0_401 1)) v_~x~0_575) (= v_~x$w_buff1_used~0_602 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_603)) (= v_~x$r_buff1_thd2~0_99 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_134 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_602 256) 0)))) 0 v_~x$r_buff1_thd2~0_100)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_135) v_~x$r_buff0_thd2~0_134) (= (ite .cse0 0 v_~x$w_buff0_used~0_655) v_~x$w_buff0_used~0_654)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_440, ~x$w_buff1~0=v_~x$w_buff1~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_603, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_655} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_440, ~x$w_buff1~0=v_~x$w_buff1~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_99, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_602, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~x~0=v_~x~0_575, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_654} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:28,709 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:45:28,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 553 [2022-12-13 00:45:28,710 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 170 flow [2022-12-13 00:45:28,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:28,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:28,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:28,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:45:28,711 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-13 00:45:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1265015228, now seen corresponding path program 1 times [2022-12-13 00:45:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629778947] [2022-12-13 00:45:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629778947] [2022-12-13 00:45:29,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629778947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:29,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:29,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601553278] [2022-12-13 00:45:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:29,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:29,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:29,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:29,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:29,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:45:29,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:29,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:29,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:45:29,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:29,511 INFO L130 PetriNetUnfolder]: 2093/3249 cut-off events. [2022-12-13 00:45:29,511 INFO L131 PetriNetUnfolder]: For 2044/2044 co-relation queries the response was YES. [2022-12-13 00:45:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8087 conditions, 3249 events. 2093/3249 cut-off events. For 2044/2044 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16593 event pairs, 853 based on Foata normal form. 24/2795 useless extension candidates. Maximal degree in co-relation 8072. Up to 2617 conditions per place. [2022-12-13 00:45:29,539 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 50 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2022-12-13 00:45:29,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 354 flow [2022-12-13 00:45:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:45:29,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 00:45:29,541 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 170 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:45:29,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 354 flow [2022-12-13 00:45:29,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 346 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 00:45:29,549 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 00:45:29,551 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2022-12-13 00:45:29,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:29,551 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:29,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:29,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,569 INFO L130 PetriNetUnfolder]: 23/140 cut-off events. [2022-12-13 00:45:29,569 INFO L131 PetriNetUnfolder]: For 128/148 co-relation queries the response was YES. [2022-12-13 00:45:29,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 140 events. 23/140 cut-off events. For 128/148 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 766 event pairs, 4 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 284. Up to 28 conditions per place. [2022-12-13 00:45:29,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 00:45:29,609 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:29,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 00:45:29,614 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 204 flow [2022-12-13 00:45:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:29,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:29,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:29,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:45:29,615 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-13 00:45:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1314164781, now seen corresponding path program 1 times [2022-12-13 00:45:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:29,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770364188] [2022-12-13 00:45:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:30,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770364188] [2022-12-13 00:45:30,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770364188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:30,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:30,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47540399] [2022-12-13 00:45:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:30,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 00:45:30,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:30,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:30,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 00:45:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:30,784 INFO L130 PetriNetUnfolder]: 1648/2667 cut-off events. [2022-12-13 00:45:30,785 INFO L131 PetriNetUnfolder]: For 2932/2942 co-relation queries the response was YES. [2022-12-13 00:45:30,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7259 conditions, 2667 events. 1648/2667 cut-off events. For 2932/2942 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14666 event pairs, 639 based on Foata normal form. 7/2230 useless extension candidates. Maximal degree in co-relation 7240. Up to 1950 conditions per place. [2022-12-13 00:45:30,803 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 53 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-12-13 00:45:30,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 456 flow [2022-12-13 00:45:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 00:45:30,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2022-12-13 00:45:30,807 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 204 flow. Second operand 5 states and 112 transitions. [2022-12-13 00:45:30,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 456 flow [2022-12-13 00:45:30,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:30,813 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-13 00:45:30,815 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2022-12-13 00:45:30,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:30,815 INFO L89 Accepts]: Start accepts. Operand has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:30,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:30,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,845 INFO L130 PetriNetUnfolder]: 88/244 cut-off events. [2022-12-13 00:45:30,845 INFO L131 PetriNetUnfolder]: For 597/647 co-relation queries the response was YES. [2022-12-13 00:45:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 244 events. 88/244 cut-off events. For 597/647 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1356 event pairs, 22 based on Foata normal form. 3/170 useless extension candidates. Maximal degree in co-relation 731. Up to 106 conditions per place. [2022-12-13 00:45:30,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 00:45:30,852 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:30,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 00:45:30,853 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 295 flow [2022-12-13 00:45:30,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:30,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:30,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:30,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:45:30,854 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-13 00:45:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -563987089, now seen corresponding path program 2 times [2022-12-13 00:45:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670222836] [2022-12-13 00:45:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:31,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:31,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670222836] [2022-12-13 00:45:31,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670222836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:31,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:31,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:31,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29658387] [2022-12-13 00:45:31,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:31,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:31,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:31,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:31,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 00:45:31,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:31,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:31,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 00:45:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:31,696 INFO L130 PetriNetUnfolder]: 1677/2736 cut-off events. [2022-12-13 00:45:31,696 INFO L131 PetriNetUnfolder]: For 6472/6497 co-relation queries the response was YES. [2022-12-13 00:45:31,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8781 conditions, 2736 events. 1677/2736 cut-off events. For 6472/6497 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 15314 event pairs, 531 based on Foata normal form. 18/2313 useless extension candidates. Maximal degree in co-relation 8759. Up to 1975 conditions per place. [2022-12-13 00:45:31,720 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 67 selfloop transitions, 30 changer transitions 0/108 dead transitions. [2022-12-13 00:45:31,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 726 flow [2022-12-13 00:45:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:45:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:45:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2022-12-13 00:45:31,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5992647058823529 [2022-12-13 00:45:31,722 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 295 flow. Second operand 8 states and 163 transitions. [2022-12-13 00:45:31,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 726 flow [2022-12-13 00:45:31,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 677 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:31,734 INFO L231 Difference]: Finished difference. Result has 67 places, 69 transitions, 467 flow [2022-12-13 00:45:31,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=67, PETRI_TRANSITIONS=69} [2022-12-13 00:45:31,737 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 00:45:31,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:31,737 INFO L89 Accepts]: Start accepts. Operand has 67 places, 69 transitions, 467 flow [2022-12-13 00:45:31,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:31,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:31,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 69 transitions, 467 flow [2022-12-13 00:45:31,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 69 transitions, 467 flow [2022-12-13 00:45:31,771 INFO L130 PetriNetUnfolder]: 103/288 cut-off events. [2022-12-13 00:45:31,772 INFO L131 PetriNetUnfolder]: For 937/966 co-relation queries the response was YES. [2022-12-13 00:45:31,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 288 events. 103/288 cut-off events. For 937/966 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1667 event pairs, 22 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 982. Up to 112 conditions per place. [2022-12-13 00:45:31,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 69 transitions, 467 flow [2022-12-13 00:45:31,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-13 00:45:31,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [445] $Ultimate##0-->L773: Formula: (and (= v_~x$w_buff0_used~0_311 1) (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_275 256) 0)) (not (= (mod v_~x$w_buff0_used~0_311 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0_used~0_312 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0~0_200 v_~x$w_buff1~0_175) (= v_~x$r_buff1_thd3~0_90 v_~x$r_buff0_thd3~0_95) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |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_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_167) (= 2 v_~x$w_buff0~0_199)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_200, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, 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_175, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_311, 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] [2022-12-13 00:45:31,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [437] L2-1-->L836: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_293 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_294 256))))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_261 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_294) v_~x$w_buff0_used~0_293) (= (ite .cse0 v_~x$w_buff0~0_185 (ite .cse1 v_~x$w_buff1~0_164 v_~x~0_229)) v_~x~0_228) (= v_~x$r_buff0_thd0~0_157 (ite .cse2 0 v_~x$r_buff0_thd0~0_158)) (= v_~x$r_buff1_thd0~0_157 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_260 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_157 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= v_~x$w_buff1_used~0_260 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_261))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_261, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x~0=v_~x~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:32,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L2-1-->L836: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_293 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_294 256))))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_261 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_294) v_~x$w_buff0_used~0_293) (= (ite .cse0 v_~x$w_buff0~0_185 (ite .cse1 v_~x$w_buff1~0_164 v_~x~0_229)) v_~x~0_228) (= v_~x$r_buff0_thd0~0_157 (ite .cse2 0 v_~x$r_buff0_thd0~0_158)) (= v_~x$r_buff1_thd0~0_157 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_260 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_157 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= v_~x$w_buff1_used~0_260 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_261))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_261, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x~0=v_~x~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [326] L747-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_124 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_108 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_109)) (= (ite .cse2 0 v_~x$w_buff0_used~0_124) v_~x$w_buff0_used~0_123) (= v_~x~0_85 (ite .cse2 v_~x$w_buff0~0_53 (ite .cse1 v_~x$w_buff1~0_48 v_~x~0_86))) (= v_~x$r_buff1_thd1~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_108 256) 0)))) 0 v_~x$r_buff1_thd1~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd1~0_20) v_~x$r_buff0_thd1~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x~0=v_~x~0_86, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_48, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17, ~x~0=v_~x~0_85, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:32,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L2-1-->L836: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_293 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_294 256))))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_261 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_294) v_~x$w_buff0_used~0_293) (= (ite .cse0 v_~x$w_buff0~0_185 (ite .cse1 v_~x$w_buff1~0_164 v_~x~0_229)) v_~x~0_228) (= v_~x$r_buff0_thd0~0_157 (ite .cse2 0 v_~x$r_buff0_thd0~0_158)) (= v_~x$r_buff1_thd0~0_157 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_260 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_157 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= v_~x$w_buff1_used~0_260 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_261))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_261, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x~0=v_~x~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [334] L776-->L783: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_27 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_117 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= v_~x~0_89 (ite .cse0 v_~x$w_buff0~0_61 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_90))) (= v_~x$w_buff0_used~0_135 (ite .cse0 0 v_~x$w_buff0_used~0_136)) (= v_~x$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_117)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_26 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_116 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_27) v_~x$r_buff0_thd2~0_26)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_117, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ~x~0=v_~x~0_90, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_116, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ~x~0=v_~x~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:32,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] L2-1-->L836: Formula: (let ((.cse3 (not (= 0 (mod v_~x$r_buff1_thd0~0_158 256)))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_293 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse5 (not (= 0 (mod v_~x$w_buff0_used~0_294 256))))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_261 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_294) v_~x$w_buff0_used~0_293) (= (ite .cse0 v_~x$w_buff0~0_185 (ite .cse1 v_~x$w_buff1~0_164 v_~x~0_229)) v_~x~0_228) (= v_~x$r_buff0_thd0~0_157 (ite .cse2 0 v_~x$r_buff0_thd0~0_158)) (= v_~x$r_buff1_thd0~0_157 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_260 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_157 256) 0)))) 0 v_~x$r_buff1_thd0~0_158)) (= v_~x$w_buff1_used~0_260 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_261))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_261, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_158, ~x~0=v_~x~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_185, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$w_buff1~0=v_~x$w_buff1~0_164, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_157, ~x~0=v_~x~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:32,628 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:45:32,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 892 [2022-12-13 00:45:32,629 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 489 flow [2022-12-13 00:45:32,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:32,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:32,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:32,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:45:32,630 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-13 00:45:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -560648978, now seen corresponding path program 1 times [2022-12-13 00:45:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:32,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255916468] [2022-12-13 00:45:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255916468] [2022-12-13 00:45:33,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255916468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:33,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:33,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100386521] [2022-12-13 00:45:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:33,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:33,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:33,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:33,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:33,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2022-12-13 00:45:33,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 489 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:33,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:33,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2022-12-13 00:45:33,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:34,115 INFO L130 PetriNetUnfolder]: 3054/4830 cut-off events. [2022-12-13 00:45:34,116 INFO L131 PetriNetUnfolder]: For 15278/15278 co-relation queries the response was YES. [2022-12-13 00:45:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16004 conditions, 4830 events. 3054/4830 cut-off events. For 15278/15278 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 27646 event pairs, 527 based on Foata normal form. 114/4149 useless extension candidates. Maximal degree in co-relation 15977. Up to 2800 conditions per place. [2022-12-13 00:45:34,144 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 80 selfloop transitions, 28 changer transitions 0/116 dead transitions. [2022-12-13 00:45:34,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 116 transitions, 967 flow [2022-12-13 00:45:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:45:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:45:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-13 00:45:34,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-13 00:45:34,146 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 489 flow. Second operand 6 states and 129 transitions. [2022-12-13 00:45:34,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 116 transitions, 967 flow [2022-12-13 00:45:34,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 116 transitions, 863 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-13 00:45:34,183 INFO L231 Difference]: Finished difference. Result has 70 places, 81 transitions, 662 flow [2022-12-13 00:45:34,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=70, PETRI_TRANSITIONS=81} [2022-12-13 00:45:34,184 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2022-12-13 00:45:34,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:34,184 INFO L89 Accepts]: Start accepts. Operand has 70 places, 81 transitions, 662 flow [2022-12-13 00:45:34,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:34,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:34,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 81 transitions, 662 flow [2022-12-13 00:45:34,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 81 transitions, 662 flow [2022-12-13 00:45:34,248 INFO L130 PetriNetUnfolder]: 213/550 cut-off events. [2022-12-13 00:45:34,248 INFO L131 PetriNetUnfolder]: For 1765/1882 co-relation queries the response was YES. [2022-12-13 00:45:34,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1897 conditions, 550 events. 213/550 cut-off events. For 1765/1882 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3575 event pairs, 23 based on Foata normal form. 13/419 useless extension candidates. Maximal degree in co-relation 1871. Up to 212 conditions per place. [2022-12-13 00:45:34,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 81 transitions, 662 flow [2022-12-13 00:45:34,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 1080 [2022-12-13 00:45:34,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [493] L2-1-->L803: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd0~0_444 256) 0)))) (let ((.cse10 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_766 256) 0))))) (let ((.cse1 (ite .cse10 0 v_~x$w_buff0_used~0_766))) (let ((.cse7 (not (= (mod v_~x$r_buff1_thd0~0_445 256) 0))) (.cse9 (not (= (mod .cse1 256) 0)))) (let ((.cse12 (and .cse14 .cse9)) (.cse11 (and .cse7 (not (= (mod v_~x$w_buff1_used~0_706 256) 0))))) (let ((.cse4 (ite (or .cse12 .cse11) 0 v_~x$w_buff1_used~0_706))) (let ((.cse5 (not (= (mod v_~x$r_buff1_thd3~0_250 256) 0))) (.cse8 (not (= (mod .cse4 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_764 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd3~0_258 256) 0)))) (let ((.cse2 (and .cse6 .cse13)) (.cse0 (and .cse9 .cse13)) (.cse3 (and .cse5 .cse8))) (and (= (ite .cse0 0 .cse1) v_~x$w_buff0_used~0_764) (= (ite (or .cse2 .cse3) 0 .cse4) v_~x$w_buff1_used~0_704) (= v_~x$r_buff0_thd3~0_257 (ite .cse2 0 v_~x$r_buff0_thd3~0_258)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_704 256) 0)) .cse5) (and .cse6 (not (= (mod v_~x$r_buff0_thd3~0_257 256) 0)))) 0 v_~x$r_buff1_thd3~0_250) v_~x$r_buff1_thd3~0_249) (= v_~x$r_buff1_thd0~0_444 (ite (or (and .cse7 .cse8) (and (not (= (mod v_~x$r_buff0_thd0~0_443 256) 0)) .cse9)) 0 v_~x$r_buff1_thd0~0_445)) (= (ite .cse0 v_~x$w_buff0~0_512 (ite .cse3 v_~x$w_buff1~0_462 (ite .cse10 v_~x$w_buff0~0_512 (ite .cse11 v_~x$w_buff1~0_462 v_~x~0_671)))) v_~x~0_669) (= (ite .cse12 0 v_~x$r_buff0_thd0~0_444) v_~x$r_buff0_thd0~0_443)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_512, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_444, ~x$w_buff1~0=v_~x$w_buff1~0_462, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_250, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_706, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_258, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_445, ~x~0=v_~x~0_671, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_766} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_512, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_443, ~x$w_buff1~0=v_~x$w_buff1~0_462, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_249, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_704, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_257, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_444, ~x~0=v_~x~0_669, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_764} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [432] L836-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd0~0_146 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd0~0_146 256) 0))) (let ((.cse8 (not .cse5)) (.cse11 (and (= (mod v_~x$w_buff1_used~0_249 256) 0) .cse5)) (.cse4 (and .cse5 .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_282 256) 0))) (let ((.cse1 (or .cse11 .cse4 .cse12)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_248 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_281 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_68 256) 0))) (.cse3 (ite .cse1 v_~x~0_217 (ite .cse2 v_~x$w_buff0~0_174 v_~x$w_buff1~0_153)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| (mod v_~main$tmp_guard1~0_46 256)) (= v_~x$w_buff0_used~0_281 (ite .cse0 v_~x$w_buff0_used~0_282 (ite .cse1 v_~x$w_buff0_used~0_282 (ite .cse2 0 v_~x$w_buff0_used~0_282)))) (= v_~x$mem_tmp~0_54 v_~x~0_217) (= v_~x$w_buff1~0_153 v_~x$w_buff1~0_152) (= v_~x$w_buff0~0_174 v_~x$w_buff0~0_173) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_52 0) (= 2 .cse3) (= v_~__unbuffered_p1_EAX~0_53 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_~x$flush_delayed~0_67 0) (= v_~weak$$choice0~0_41 |v_ULTIMATE.start_main_#t~nondet9#1_83|) (= v_~x$r_buff0_thd0~0_145 (ite .cse0 v_~x$r_buff0_thd0~0_146 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~x$r_buff0_thd0~0_146 (ite (and (not .cse7) .cse8) 0 v_~x$r_buff0_thd0~0_146)))) (= (ite .cse0 v_~x$r_buff1_thd0~0_146 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_145 256) 0))) (or (and .cse9 .cse6) .cse7 (and .cse9 .cse10))) v_~x$r_buff1_thd0~0_146 0)) v_~x$r_buff1_thd0~0_145) (= |v_ULTIMATE.start_main_#t~nondet10#1_103| v_~weak$$choice2~0_68) (= v_~x$w_buff1_used~0_248 (ite .cse0 v_~x$w_buff1_used~0_249 (ite (or .cse11 .cse4 .cse7) v_~x$w_buff1_used~0_249 0))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_37| 0) (= (ite .cse0 v_~x$mem_tmp~0_54 .cse3) v_~x~0_216)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_174, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_146, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_103|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_83|, ~x$w_buff1~0=v_~x$w_buff1~0_153, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_249, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_146, ~x~0=v_~x~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_282} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_173, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_145, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_152, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_248, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~x$mem_tmp~0=v_~x$mem_tmp~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_145, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_281, ~weak$$choice0~0=v_~weak$$choice0~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_68, ~x~0=v_~x~0_216} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0] [2022-12-13 00:45:35,091 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:35,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 908 [2022-12-13 00:45:35,092 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 81 transitions, 670 flow [2022-12-13 00:45:35,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:35,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:35,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:35,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:45:35,093 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-13 00:45:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1195807497, now seen corresponding path program 1 times [2022-12-13 00:45:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:35,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341893078] [2022-12-13 00:45:35,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:35,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-13 00:45:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:35,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341893078] [2022-12-13 00:45:35,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341893078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:35,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:35,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:45:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823305319] [2022-12-13 00:45:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:35,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:45:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:45:35,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:45:35,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2022-12-13 00:45:35,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 81 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:35,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:35,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2022-12-13 00:45:35,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:35,814 INFO L130 PetriNetUnfolder]: 3430/5430 cut-off events. [2022-12-13 00:45:35,814 INFO L131 PetriNetUnfolder]: For 19742/20077 co-relation queries the response was YES. [2022-12-13 00:45:35,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18955 conditions, 5430 events. 3430/5430 cut-off events. For 19742/20077 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 32728 event pairs, 894 based on Foata normal form. 141/3898 useless extension candidates. Maximal degree in co-relation 18926. Up to 5056 conditions per place. [2022-12-13 00:45:35,850 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 72 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2022-12-13 00:45:35,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 859 flow [2022-12-13 00:45:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:45:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:45:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 00:45:35,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2022-12-13 00:45:35,852 INFO L175 Difference]: Start difference. First operand has 70 places, 81 transitions, 670 flow. Second operand 3 states and 77 transitions. [2022-12-13 00:45:35,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 859 flow [2022-12-13 00:45:35,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 823 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 00:45:35,903 INFO L231 Difference]: Finished difference. Result has 69 places, 78 transitions, 569 flow [2022-12-13 00:45:35,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=69, PETRI_TRANSITIONS=78} [2022-12-13 00:45:35,904 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2022-12-13 00:45:35,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:35,904 INFO L89 Accepts]: Start accepts. Operand has 69 places, 78 transitions, 569 flow [2022-12-13 00:45:35,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:35,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:35,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 78 transitions, 569 flow [2022-12-13 00:45:35,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 78 transitions, 569 flow [2022-12-13 00:45:36,180 INFO L130 PetriNetUnfolder]: 1452/2744 cut-off events. [2022-12-13 00:45:36,180 INFO L131 PetriNetUnfolder]: For 4824/5014 co-relation queries the response was YES. [2022-12-13 00:45:36,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8321 conditions, 2744 events. 1452/2744 cut-off events. For 4824/5014 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 21230 event pairs, 554 based on Foata normal form. 33/1616 useless extension candidates. Maximal degree in co-relation 8295. Up to 1681 conditions per place. [2022-12-13 00:45:36,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 78 transitions, 569 flow [2022-12-13 00:45:36,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-13 00:45:36,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L825-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_Out_2|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [489] L744-->L836: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd0~0_433 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_432 256) 0))) (.cse1 (not (= 0 (mod v_~x$w_buff0_used~0_744 256))))) (let ((.cse2 (and .cse5 .cse1)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_745 256) 0)))) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_685 256) 0)) .cse0))) (and (= v_~x$r_buff1_thd0~0_432 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_684 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd0~0_431 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_433)) (= v_~x$w_buff1_used~0_684 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_685)) (= (ite .cse4 0 v_~x$w_buff0_used~0_745) v_~x$w_buff0_used~0_744) (= v_~x$r_buff0_thd0~0_431 (ite .cse2 0 v_~x$r_buff0_thd0~0_432)) (= (ite .cse4 v_~x$w_buff0~0_504 (ite .cse3 v_~x$w_buff1~0_454 1)) v_~x~0_649)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_504, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_432, ~x$w_buff1~0=v_~x$w_buff1~0_454, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_685, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_433, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_745} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_504, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_431, ~x$w_buff1~0=v_~x$w_buff1~0_454, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_684, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_432, ~x~0=v_~x~0_649, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_744} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:36,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:36,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 979 [2022-12-13 00:45:36,883 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 78 transitions, 575 flow [2022-12-13 00:45:36,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:36,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:36,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:36,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:45:36,884 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-13 00:45:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1455207066, now seen corresponding path program 1 times [2022-12-13 00:45:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:36,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403131209] [2022-12-13 00:45:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:37,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403131209] [2022-12-13 00:45:37,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403131209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:37,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:37,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99351952] [2022-12-13 00:45:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:37,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:37,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-13 00:45:37,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 78 transitions, 575 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:37,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:37,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-13 00:45:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:37,497 INFO L130 PetriNetUnfolder]: 1684/3051 cut-off events. [2022-12-13 00:45:37,497 INFO L131 PetriNetUnfolder]: For 8816/8933 co-relation queries the response was YES. [2022-12-13 00:45:37,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12086 conditions, 3051 events. 1684/3051 cut-off events. For 8816/8933 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 19497 event pairs, 201 based on Foata normal form. 251/2396 useless extension candidates. Maximal degree in co-relation 12057. Up to 2125 conditions per place. [2022-12-13 00:45:37,514 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 76 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2022-12-13 00:45:37,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 947 flow [2022-12-13 00:45:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-13 00:45:37,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-13 00:45:37,516 INFO L175 Difference]: Start difference. First operand has 69 places, 78 transitions, 575 flow. Second operand 4 states and 102 transitions. [2022-12-13 00:45:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 947 flow [2022-12-13 00:45:37,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 864 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 00:45:37,540 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2022-12-13 00:45:37,541 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2022-12-13 00:45:37,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:37,541 INFO L89 Accepts]: Start accepts. Operand has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:37,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:37,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,687 INFO L130 PetriNetUnfolder]: 678/1577 cut-off events. [2022-12-13 00:45:37,688 INFO L131 PetriNetUnfolder]: For 2302/3294 co-relation queries the response was YES. [2022-12-13 00:45:37,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 1577 events. 678/1577 cut-off events. For 2302/3294 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 12595 event pairs, 164 based on Foata normal form. 31/996 useless extension candidates. Maximal degree in co-relation 5551. Up to 976 conditions per place. [2022-12-13 00:45:37,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 00:45:37,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:37,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 00:45:37,708 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 553 flow [2022-12-13 00:45:37,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:37,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:37,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:37,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:45:37,709 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:45:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 447736971, now seen corresponding path program 1 times [2022-12-13 00:45:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948589783] [2022-12-13 00:45:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:37,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948589783] [2022-12-13 00:45:37,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948589783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:37,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:37,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:45:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834630814] [2022-12-13 00:45:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:37,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:45:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:45:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:45:37,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 00:45:37,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:37,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:37,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 00:45:37,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:38,115 INFO L130 PetriNetUnfolder]: 955/1791 cut-off events. [2022-12-13 00:45:38,115 INFO L131 PetriNetUnfolder]: For 4036/4081 co-relation queries the response was YES. [2022-12-13 00:45:38,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7714 conditions, 1791 events. 955/1791 cut-off events. For 4036/4081 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10561 event pairs, 57 based on Foata normal form. 221/1403 useless extension candidates. Maximal degree in co-relation 7687. Up to 916 conditions per place. [2022-12-13 00:45:38,128 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 66 selfloop transitions, 28 changer transitions 1/109 dead transitions. [2022-12-13 00:45:38,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 940 flow [2022-12-13 00:45:38,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-13 00:45:38,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2022-12-13 00:45:38,130 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 553 flow. Second operand 5 states and 107 transitions. [2022-12-13 00:45:38,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 940 flow [2022-12-13 00:45:38,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 886 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:38,140 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 577 flow [2022-12-13 00:45:38,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2022-12-13 00:45:38,142 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2022-12-13 00:45:38,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:38,142 INFO L89 Accepts]: Start accepts. Operand has 69 places, 80 transitions, 577 flow [2022-12-13 00:45:38,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:38,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:38,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 80 transitions, 577 flow [2022-12-13 00:45:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 80 transitions, 577 flow [2022-12-13 00:45:38,219 INFO L130 PetriNetUnfolder]: 291/767 cut-off events. [2022-12-13 00:45:38,219 INFO L131 PetriNetUnfolder]: For 766/1167 co-relation queries the response was YES. [2022-12-13 00:45:38,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 767 events. 291/767 cut-off events. For 766/1167 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5477 event pairs, 2 based on Foata normal form. 3/373 useless extension candidates. Maximal degree in co-relation 2700. Up to 487 conditions per place. [2022-12-13 00:45:38,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 80 transitions, 577 flow [2022-12-13 00:45:38,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 984 [2022-12-13 00:45:39,128 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:45:39,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 987 [2022-12-13 00:45:39,129 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 573 flow [2022-12-13 00:45:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:39,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:39,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:39,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:45:39,130 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:45:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1960088432, now seen corresponding path program 1 times [2022-12-13 00:45:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:39,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101342088] [2022-12-13 00:45:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:39,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101342088] [2022-12-13 00:45:39,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101342088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:39,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:39,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340833263] [2022-12-13 00:45:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:39,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:39,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 00:45:39,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 573 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:39,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:39,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 00:45:39,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:39,647 INFO L130 PetriNetUnfolder]: 1271/2298 cut-off events. [2022-12-13 00:45:39,647 INFO L131 PetriNetUnfolder]: For 6330/6538 co-relation queries the response was YES. [2022-12-13 00:45:39,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10175 conditions, 2298 events. 1271/2298 cut-off events. For 6330/6538 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14586 event pairs, 106 based on Foata normal form. 153/1941 useless extension candidates. Maximal degree in co-relation 10147. Up to 1070 conditions per place. [2022-12-13 00:45:39,656 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 61 selfloop transitions, 1 changer transitions 63/142 dead transitions. [2022-12-13 00:45:39,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 142 transitions, 1302 flow [2022-12-13 00:45:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:45:39,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:45:39,658 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 573 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:45:39,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 142 transitions, 1302 flow [2022-12-13 00:45:39,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 1166 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:39,697 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 449 flow [2022-12-13 00:45:39,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2022-12-13 00:45:39,698 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2022-12-13 00:45:39,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:39,698 INFO L89 Accepts]: Start accepts. Operand has 69 places, 70 transitions, 449 flow [2022-12-13 00:45:39,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:39,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:39,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 449 flow [2022-12-13 00:45:39,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 70 transitions, 449 flow [2022-12-13 00:45:39,738 INFO L130 PetriNetUnfolder]: 272/620 cut-off events. [2022-12-13 00:45:39,738 INFO L131 PetriNetUnfolder]: For 785/824 co-relation queries the response was YES. [2022-12-13 00:45:39,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 620 events. 272/620 cut-off events. For 785/824 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 4073 event pairs, 1 based on Foata normal form. 10/253 useless extension candidates. Maximal degree in co-relation 1826. Up to 298 conditions per place. [2022-12-13 00:45:39,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 70 transitions, 449 flow [2022-12-13 00:45:39,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 00:45:39,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [341] L796-->L803: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_20)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_45 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:39,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L744-->L747: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [445] $Ultimate##0-->L773: Formula: (and (= v_~x$w_buff0_used~0_311 1) (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_275 256) 0)) (not (= (mod v_~x$w_buff0_used~0_311 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0_used~0_312 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0~0_200 v_~x$w_buff1~0_175) (= v_~x$r_buff1_thd3~0_90 v_~x$r_buff0_thd3~0_95) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |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_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_167) (= 2 v_~x$w_buff0~0_199)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_200, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, 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_175, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_311, 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] [2022-12-13 00:45:40,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] and [445] $Ultimate##0-->L773: Formula: (and (= v_~x$w_buff0_used~0_311 1) (= v_~x$r_buff0_thd2~0_60 1) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_61) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_275 256) 0)) (not (= (mod v_~x$w_buff0_used~0_311 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0_used~0_312 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0~0_200 v_~x$w_buff1~0_175) (= v_~x$r_buff1_thd3~0_90 v_~x$r_buff0_thd3~0_95) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |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_thd1~0_47 v_~x$r_buff0_thd1~0_49) (= v_~x$r_buff0_thd0~0_171 v_~x$r_buff1_thd0~0_167) (= 2 v_~x$w_buff0~0_199)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_200, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_312} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_171, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, 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_175, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_47, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_167, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_311, 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] [2022-12-13 00:45:40,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] and [506] $Ultimate##0-->L803: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_822 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_274 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_266 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_759 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_823 256) 0)))) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 v_~x$w_buff0~0_546 (ite .cse1 v_~x$w_buff1~0_492 1)) v_~x~0_717) (= v_~x$w_buff1_used~0_758 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_759)) (= v_~x$w_buff0_used~0_822 (ite .cse0 0 v_~x$w_buff0_used~0_823)) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_274) v_~x$r_buff0_thd3~0_273) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|) (= v_~z~0_35 1) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_273 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_758 256) 0)))) 0 v_~x$r_buff1_thd3~0_266) v_~x$r_buff1_thd3~0_265)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_546, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_492, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_266, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_759, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_274, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_823} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_546, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_492, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_265, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_758, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_273, ~z~0=v_~z~0_35, ~x~0=v_~x~0_717, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_822, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:45:40,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] and [507] $Ultimate##0-->L754: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_165 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_826 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_164 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_827 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_763 256) 0))))) (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_763) v_~x$w_buff1_used~0_762) (= (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_762 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_165) v_~x$r_buff1_thd1~0_164) (= v_~z~0_37 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= (ite .cse1 0 v_~x$r_buff0_thd1~0_164) v_~x$r_buff0_thd1~0_163) (= (ite .cse4 0 v_~x$w_buff0_used~0_827) v_~x$w_buff0_used~0_826) (= (ite .cse4 v_~x$w_buff0~0_548 (ite .cse0 v_~x$w_buff1~0_494 1)) v_~x~0_719)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_548, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_164, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_494, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_763, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_827} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_548, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~x$w_buff1~0=v_~x$w_buff1~0_494, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_762, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_164, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~z~0=v_~z~0_37, ~x~0=v_~x~0_719, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~z~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:45:40,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L793-->L796: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] and [508] $Ultimate##0-->L773: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_59| |v_P1Thread1of1ForFork0_~arg#1.offset_59|) (= v_~x$r_buff0_thd2~0_201 v_~x$r_buff1_thd2~0_139) (= |v_P1Thread1of1ForFork0_~arg#1.base_59| |v_P1Thread1of1ForFork0_#in~arg#1.base_59|) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= v_~x$r_buff0_thd3~0_277 v_~x$r_buff1_thd3~0_269) (= v_~x$w_buff0~0_551 v_~x$w_buff1~0_496) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| 0)) (= v_~z~0_39 1) (= v_~x~0_721 1) (= v_~x$w_buff0_used~0_830 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|) (= v_~x$r_buff0_thd2~0_200 1) (= v_~x$r_buff0_thd0~0_479 v_~x$r_buff1_thd0~0_480) (= 2 v_~x$w_buff0~0_550) (= v_~x$r_buff0_thd1~0_167 v_~x$r_buff1_thd1~0_168) (= v_~x$w_buff0_used~0_831 v_~x$w_buff1_used~0_766) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_830 256) 0)) (not (= (mod v_~x$w_buff1_used~0_766 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_551, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_479, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_59|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_167, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_277, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_201, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_831} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_550, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_479, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_167, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_59|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_59|, ~x$w_buff1~0=v_~x$w_buff1~0_496, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_269, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_139, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_766, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_168, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_277, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_480, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_59|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_830, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_59|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, ~z~0=v_~z~0_39, ~x~0=v_~x~0_721} 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, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0] [2022-12-13 00:45:41,021 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:45:41,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1324 [2022-12-13 00:45:41,022 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 488 flow [2022-12-13 00:45:41,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:41,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:41,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:41,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:45:41,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:45:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash -25432616, now seen corresponding path program 1 times [2022-12-13 00:45:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529853667] [2022-12-13 00:45:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:41,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:41,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529853667] [2022-12-13 00:45:41,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529853667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:41,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:41,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203128530] [2022-12-13 00:45:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:41,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:41,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:41,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:41,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 00:45:41,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:41,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:41,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 00:45:41,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:41,458 INFO L130 PetriNetUnfolder]: 997/1827 cut-off events. [2022-12-13 00:45:41,458 INFO L131 PetriNetUnfolder]: For 4814/4920 co-relation queries the response was YES. [2022-12-13 00:45:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7147 conditions, 1827 events. 997/1827 cut-off events. For 4814/4920 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 11395 event pairs, 194 based on Foata normal form. 92/1462 useless extension candidates. Maximal degree in co-relation 7118. Up to 685 conditions per place. [2022-12-13 00:45:41,466 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 40 selfloop transitions, 1 changer transitions 58/112 dead transitions. [2022-12-13 00:45:41,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 980 flow [2022-12-13 00:45:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:45:41,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2022-12-13 00:45:41,468 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 488 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:45:41,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 980 flow [2022-12-13 00:45:41,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 905 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-13 00:45:41,496 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 301 flow [2022-12-13 00:45:41,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2022-12-13 00:45:41,497 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2022-12-13 00:45:41,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:41,498 INFO L89 Accepts]: Start accepts. Operand has 64 places, 51 transitions, 301 flow [2022-12-13 00:45:41,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:41,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:41,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 51 transitions, 301 flow [2022-12-13 00:45:41,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 301 flow [2022-12-13 00:45:41,532 INFO L130 PetriNetUnfolder]: 224/491 cut-off events. [2022-12-13 00:45:41,533 INFO L131 PetriNetUnfolder]: For 608/635 co-relation queries the response was YES. [2022-12-13 00:45:41,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 491 events. 224/491 cut-off events. For 608/635 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 3044 event pairs, 0 based on Foata normal form. 9/191 useless extension candidates. Maximal degree in co-relation 1412. Up to 244 conditions per place. [2022-12-13 00:45:41,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 301 flow [2022-12-13 00:45:41,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-13 00:45:41,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L796: Formula: (and (= v_~y~0_31 1) (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_~z~0_59 v_~__unbuffered_p2_EAX~0_146) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z~0=v_~z~0_59} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~z~0=v_~z~0_59, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [509] $Ultimate##0-->L803: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_272 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_834 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_280 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_835 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_769 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_280) v_~x$r_buff0_thd3~0_279) (= v_~x$w_buff0_used~0_834 (ite .cse1 0 v_~x$w_buff0_used~0_835)) (= v_~z~0_41 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_25| v_P0Thread1of1ForFork2_~arg.offset_25) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_769) v_~x$w_buff1_used~0_768) (= (ite .cse1 v_~x$w_buff0~0_554 (ite .cse2 v_~x$w_buff1~0_498 1)) v_~x~0_723) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_768 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_279 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_272) v_~x$r_buff1_thd3~0_271) (= v_P0Thread1of1ForFork2_~arg.base_25 |v_P0Thread1of1ForFork2_#in~arg.base_25|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_554, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_498, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_272, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_769, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_280, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_835} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_554, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_498, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_25, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_271, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_768, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_279, ~z~0=v_~z~0_41, ~x~0=v_~x~0_723, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_834, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_25} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:45:42,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] $Ultimate##0-->L776: Formula: (and (= v_~x$r_buff0_thd1~0_179 v_~x$r_buff1_thd1~0_180) (= v_~x$w_buff0_used~0_872 1) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_144) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= |v_P1Thread1of1ForFork0_~arg#1.base_67| |v_P1Thread1of1ForFork0_#in~arg#1.base_67|) (= v_~x$r_buff0_thd2~0_223 v_~x$r_buff1_thd2~0_153) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_800 256) 0)) (not (= (mod v_~x$w_buff0_used~0_872 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_222 1) (= v_~x$r_buff0_thd3~0_301 v_~x$r_buff1_thd3~0_293) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$w_buff0_used~0_873 v_~x$w_buff1_used~0_800) (= v_~x$w_buff0~0_579 v_~x$w_buff1~0_516) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_67| |v_P1Thread1of1ForFork0_~arg#1.offset_67|) (= 2 v_~x$w_buff0~0_578) (= v_~x$r_buff0_thd0~0_487 v_~x$r_buff1_thd0~0_488)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_579, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_487, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_67|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_301, ~y~0=v_~y~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_223, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_873} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_578, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_487, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_67|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_67|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_293, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_800, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_180, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_301, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_222, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_488, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_872, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_67|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_144, ~y~0=v_~y~0_41} 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, ~__unbuffered_p1_EAX~0] and [517] $Ultimate##0-->L803: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_858 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_284 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd3~0_292 256))))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_859 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_789 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~z~0_61 v_~__unbuffered_p2_EAX~0_148) (= (ite .cse0 v_~x$w_buff0~0_570 (ite .cse1 v_~x$w_buff1~0_510 v_~x~0_738)) v_~x~0_737) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_292) v_~x$r_buff0_thd3~0_291) (= v_~x$w_buff0_used~0_858 (ite .cse0 0 v_~x$w_buff0_used~0_859)) (= v_~x$r_buff1_thd3~0_283 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_788 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_291 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_284)) (= v_~y~0_35 1) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|) (= v_~x$w_buff1_used~0_788 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_789))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_570, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_510, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_284, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_789, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_292, ~z~0=v_~z~0_61, ~x~0=v_~x~0_738, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_859} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_570, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, ~x$w_buff1~0=v_~x$w_buff1~0_510, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_788, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_291, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_858, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_148, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z~0=v_~z~0_61, ~y~0=v_~y~0_35, ~x~0=v_~x~0_737} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:45:42,280 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [520] $Ultimate##0-->L776: Formula: (and (= v_~x$r_buff0_thd1~0_179 v_~x$r_buff1_thd1~0_180) (= v_~x$w_buff0_used~0_872 1) (= v_~y~0_41 v_~__unbuffered_p1_EAX~0_144) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= |v_P1Thread1of1ForFork0_~arg#1.base_67| |v_P1Thread1of1ForFork0_#in~arg#1.base_67|) (= v_~x$r_buff0_thd2~0_223 v_~x$r_buff1_thd2~0_153) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_800 256) 0)) (not (= (mod v_~x$w_buff0_used~0_872 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_222 1) (= v_~x$r_buff0_thd3~0_301 v_~x$r_buff1_thd3~0_293) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$w_buff0_used~0_873 v_~x$w_buff1_used~0_800) (= v_~x$w_buff0~0_579 v_~x$w_buff1~0_516) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_67| |v_P1Thread1of1ForFork0_~arg#1.offset_67|) (= 2 v_~x$w_buff0~0_578) (= v_~x$r_buff0_thd0~0_487 v_~x$r_buff1_thd0~0_488)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_579, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_487, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_67|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_301, ~y~0=v_~y~0_41, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_223, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_873} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_578, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_487, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_67|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_67|, ~x$w_buff1~0=v_~x$w_buff1~0_516, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_293, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_800, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_180, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_301, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_222, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_488, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_67|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_872, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_67|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_144, ~y~0=v_~y~0_41} 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, ~__unbuffered_p1_EAX~0] and [518] $Ultimate##0-->L803: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_862 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_288 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_296 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_863 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_793 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_863) v_~x$w_buff0_used~0_862) (= v_~z~0_63 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_35| v_P0Thread1of1ForFork2_~arg.offset_35) (= (ite .cse0 v_~x$w_buff0~0_572 (ite .cse1 v_~x$w_buff1~0_512 1)) v_~x~0_741) (= v_~x$r_buff1_thd3~0_287 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_295 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_792 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_288)) (= v_~z~0_64 v_~__unbuffered_p2_EAX~0_150) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_296) v_~x$r_buff0_thd3~0_295) (= v_~x$w_buff1_used~0_792 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_793)) (= v_P0Thread1of1ForFork2_~arg.base_35 |v_P0Thread1of1ForFork2_#in~arg.base_35|) (= v_~y~0_37 1) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_572, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_35|, ~x$w_buff1~0=v_~x$w_buff1~0_512, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_793, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_35|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_296, ~z~0=v_~z~0_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_863} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_572, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, ~x$w_buff1~0=v_~x$w_buff1~0_512, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_287, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_792, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_35|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_295, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_862, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_35, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_35|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_150, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_63, ~y~0=v_~y~0_37, ~x~0=v_~x~0_741} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:45:42,501 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:45:42,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1004 [2022-12-13 00:45:42,502 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 333 flow [2022-12-13 00:45:42,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:42,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:42,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:42,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:45:42,502 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:45:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1283020001, now seen corresponding path program 1 times [2022-12-13 00:45:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:42,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273638186] [2022-12-13 00:45:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:45:42,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:45:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:45:42,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:45:42,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:45:42,584 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:45:42,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:45:42,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:45:42,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:45:42,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:45:42,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:45:42,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:45:42,587 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:42,592 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:45:42,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:45:42,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:45:42 BasicIcfg [2022-12-13 00:45:42,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:45:42,635 INFO L158 Benchmark]: Toolchain (without parser) took 29712.00ms. Allocated memory was 179.3MB in the beginning and 850.4MB in the end (delta: 671.1MB). Free memory was 153.8MB in the beginning and 656.2MB in the end (delta: -502.4MB). Peak memory consumption was 169.9MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,635 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:45:42,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.11ms. Allocated memory is still 179.3MB. Free memory was 153.5MB in the beginning and 127.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.39ms. Allocated memory is still 179.3MB. Free memory was 127.3MB in the beginning and 124.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,636 INFO L158 Benchmark]: Boogie Preprocessor took 53.31ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,636 INFO L158 Benchmark]: RCFGBuilder took 647.10ms. Allocated memory is still 179.3MB. Free memory was 122.5MB in the beginning and 87.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,636 INFO L158 Benchmark]: TraceAbstraction took 28353.37ms. Allocated memory was 179.3MB in the beginning and 850.4MB in the end (delta: 671.1MB). Free memory was 86.4MB in the beginning and 656.2MB in the end (delta: -569.8MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. [2022-12-13 00:45:42,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 576.11ms. Allocated memory is still 179.3MB. Free memory was 153.5MB in the beginning and 127.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.39ms. Allocated memory is still 179.3MB. Free memory was 127.3MB in the beginning and 124.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.31ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 647.10ms. Allocated memory is still 179.3MB. Free memory was 122.5MB in the beginning and 87.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 28353.37ms. Allocated memory was 179.3MB in the beginning and 850.4MB in the end (delta: 671.1MB). Free memory was 86.4MB in the beginning and 656.2MB in the end (delta: -569.8MB). Peak memory consumption was 102.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 113 PlacesBefore, 70 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 2972, independent unconditional: 0, dependent: 255, dependent conditional: 255, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3227, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1589, independent conditional: 0, independent unconditional: 1589, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 576, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 554, dependent conditional: 0, dependent unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3227, independent: 1365, independent conditional: 0, independent unconditional: 1365, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3149, Positive conditional cache size: 0, Positive unconditional cache size: 3149, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, 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.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 226, independent conditional: 16, independent unconditional: 210, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 220, independent: 198, independent conditional: 15, independent unconditional: 183, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 220, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 129, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 109, dependent conditional: 68, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 28, independent conditional: 1, independent unconditional: 27, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 220, unknown conditional: 17, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 198, Positive conditional cache size: 15, Positive unconditional cache size: 183, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 275, independent: 244, independent conditional: 16, independent unconditional: 228, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 275, independent: 244, independent conditional: 12, independent unconditional: 232, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 275, independent: 244, independent conditional: 12, independent unconditional: 232, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 38, independent conditional: 9, independent unconditional: 29, 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: 40, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 275, independent: 206, independent conditional: 3, independent unconditional: 203, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 40, unknown conditional: 9, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 236, Positive conditional cache size: 24, Positive unconditional cache size: 212, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 48 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 742 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 726, independent: 657, independent conditional: 657, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 726, independent: 657, independent conditional: 136, independent unconditional: 521, dependent: 69, dependent conditional: 6, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 733, independent: 657, independent conditional: 95, independent unconditional: 562, dependent: 76, dependent conditional: 13, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 733, independent: 657, independent conditional: 95, independent unconditional: 562, dependent: 76, dependent conditional: 13, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 14, independent unconditional: 9, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 20, dependent conditional: 12, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 733, independent: 634, independent conditional: 81, independent unconditional: 553, dependent: 73, dependent conditional: 11, dependent unconditional: 62, unknown: 26, unknown conditional: 16, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 283, Positive conditional cache size: 38, Positive unconditional cache size: 245, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 227, independent conditional: 56, independent unconditional: 171, dependent: 21, dependent conditional: 8, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 254, independent: 227, independent conditional: 44, independent unconditional: 183, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 227, independent conditional: 44, independent unconditional: 183, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 13, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, independent: 208, independent conditional: 38, independent unconditional: 170, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 24, unknown conditional: 8, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 302, Positive conditional cache size: 44, Positive unconditional cache size: 258, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 273, independent: 250, independent conditional: 60, independent unconditional: 190, dependent: 23, dependent conditional: 9, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 273, independent: 250, independent conditional: 44, independent unconditional: 206, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 273, independent: 250, independent conditional: 44, independent unconditional: 206, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 273, independent: 250, independent conditional: 44, independent unconditional: 206, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 302, Positive conditional cache size: 44, Positive unconditional cache size: 258, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 67 PlacesBefore, 65 PlacesAfterwards, 69 TransitionsBefore, 67 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 687, independent: 621, independent conditional: 621, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 687, independent: 621, independent conditional: 273, independent unconditional: 348, dependent: 66, dependent conditional: 22, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 687, independent: 621, independent conditional: 209, independent unconditional: 412, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 687, independent: 621, independent conditional: 209, independent unconditional: 412, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 687, independent: 611, independent conditional: 203, independent unconditional: 408, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 371, Positive conditional cache size: 52, Positive unconditional cache size: 319, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 70 PlacesBefore, 70 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 658, independent: 612, independent conditional: 612, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 658, independent: 612, independent conditional: 234, independent unconditional: 378, dependent: 46, dependent conditional: 28, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 678, independent: 612, independent conditional: 162, independent unconditional: 450, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 678, independent: 612, independent conditional: 162, independent unconditional: 450, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 678, independent: 605, independent conditional: 162, independent unconditional: 443, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 380, Positive conditional cache size: 52, Positive unconditional cache size: 328, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 120, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 69 PlacesBefore, 69 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 421, independent: 396, independent conditional: 396, 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: 421, independent: 396, independent conditional: 122, independent unconditional: 274, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 438, independent: 396, independent conditional: 85, independent unconditional: 311, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 438, independent: 396, independent conditional: 85, independent unconditional: 311, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 438, independent: 389, independent conditional: 83, independent unconditional: 306, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 395, Positive conditional cache size: 54, Positive unconditional cache size: 341, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 216, independent: 204, independent conditional: 88, independent unconditional: 116, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 204, independent conditional: 76, independent unconditional: 128, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 204, independent conditional: 76, independent unconditional: 128, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 204, independent conditional: 76, independent unconditional: 128, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 395, Positive conditional cache size: 54, Positive unconditional cache size: 341, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 69 PlacesBefore, 67 PlacesAfterwards, 80 TransitionsBefore, 78 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 368, independent: 344, independent conditional: 176, independent unconditional: 168, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, independent: 344, independent conditional: 152, independent unconditional: 192, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, independent: 344, independent conditional: 152, independent unconditional: 192, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, independent: 344, independent conditional: 152, independent unconditional: 192, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 402, Positive conditional cache size: 54, Positive unconditional cache size: 348, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 67 PlacesBefore, 65 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 310, independent conditional: 310, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 310, independent conditional: 196, independent unconditional: 114, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 310, independent conditional: 170, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 310, independent conditional: 170, independent unconditional: 140, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 308, independent conditional: 170, independent unconditional: 138, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 516, Positive conditional cache size: 56, Positive unconditional cache size: 460, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 59 PlacesBefore, 57 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 56, independent conditional: 48, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 48, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 38, independent conditional: 31, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 17, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 566, Positive conditional cache size: 74, Positive unconditional cache size: 492, Negative cache size: 32, Negative conditional cache size: 6, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1403, ((void *)0), P0, ((void *)0))=-2, t1403={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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, z=0] [L822] 0 pthread_t t1404; [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1404, ((void *)0), P1, ((void *)0))=-1, t1403={5:0}, t1404={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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, z=0] [L824] 0 pthread_t t1405; [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1405, ((void *)0), P2, ((void *)0))=0, t1403={5:0}, t1404={6:0}, t1405={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 [L775] 2 __unbuffered_p1_EAX = y [L792] 2 y = 1 [L795] 2 __unbuffered_p2_EAX = z [L743] 2 z = 1 [L746] 2 x = 1 [L798] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 2 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 [L801] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 2 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 821]: 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: 825]: 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, 135 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: 28.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 339 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1244 IncrementalHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 15 mSDtfsCounter, 1244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:45:42,664 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...