/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:21:52,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:21:52,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:21:52,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:21:52,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:21:52,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:21:52,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:21:52,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:21:52,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:21:52,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:21:52,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:21:52,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:21:52,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:21:52,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:21:52,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:21:52,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:21:52,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:21:52,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:21:52,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:21:52,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:21:52,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:21:52,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:21:52,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:21:52,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:21:52,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:21:52,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:21:52,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:21:52,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:21:52,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:21:52,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:21:52,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:21:52,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:21:52,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:21:52,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:21:52,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:21:52,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:21:52,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:21:52,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:21:52,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:21:52,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:21:52,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:21:52,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:21:52,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:21:52,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:21:52,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:21:52,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:21:52,488 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:21:52,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:21:52,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:21:52,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:21:52,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:21:52,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:21:52,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:21:52,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:21:52,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:21:52,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:21:52,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:21:52,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:21:52,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:21:52,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:21:52,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:21:52,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:21:52,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:21:52,758 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:21:52,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:21:53,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:21:54,107 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:21:54,108 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:21:54,118 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7647471/758a809334674f7b81713c3917e6059f/FLAGabf8bb85d [2022-12-06 04:21:54,148 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7647471/758a809334674f7b81713c3917e6059f [2022-12-06 04:21:54,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:21:54,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:21:54,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:21:54,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:21:54,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:21:54,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7efae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54, skipping insertion in model container [2022-12-06 04:21:54,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:21:54,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:21:54,343 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-06 04:21:54,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:21:54,536 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:21:54,546 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/rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2022-12-06 04:21:54,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:21:54,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:21:54,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:21:54,620 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:21:54,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54 WrapperNode [2022-12-06 04:21:54,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:21:54,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:21:54,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:21:54,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:21:54,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,664 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-06 04:21:54,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:21:54,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:21:54,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:21:54,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:21:54,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,682 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:21:54,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:21:54,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:21:54,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:21:54,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (1/1) ... [2022-12-06 04:21:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:21:54,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:21:54,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:21:54,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:21:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:21:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:21:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:21:54,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:21:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:21:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:21:54,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:21:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:21:54,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:21:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:21:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:21:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:21:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:21:54,793 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:21:54,916 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:21:54,917 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:21:55,170 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:21:55,298 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:21:55,299 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:21:55,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:21:55 BoogieIcfgContainer [2022-12-06 04:21:55,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:21:55,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:21:55,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:21:55,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:21:55,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:21:54" (1/3) ... [2022-12-06 04:21:55,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1224e750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:21:55, skipping insertion in model container [2022-12-06 04:21:55,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:21:54" (2/3) ... [2022-12-06 04:21:55,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1224e750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:21:55, skipping insertion in model container [2022-12-06 04:21:55,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:21:55" (3/3) ... [2022-12-06 04:21:55,311 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:21:55,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:21:55,325 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:21:55,325 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:21:55,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:21:55,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 04:21:55,449 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 04:21:55,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:21:55,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-06 04:21:55,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-06 04:21:55,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:55,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 04:21:55,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 186 flow [2022-12-06 04:21:55,504 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-06 04:21:55,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:55,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-06 04:21:55,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 90 transitions, 186 flow [2022-12-06 04:21:55,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-06 04:21:59,363 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-06 04:21:59,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:21:59,378 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;@380504d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:21:59,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 04:21:59,381 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 04:21:59,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:59,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:59,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:21:59,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:21:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash 458419482, now seen corresponding path program 1 times [2022-12-06 04:21:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361473162] [2022-12-06 04:21:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:21:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:21:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:21:59,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:21:59,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361473162] [2022-12-06 04:21:59,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361473162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:21:59,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:21:59,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:21:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722161493] [2022-12-06 04:21:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:21:59,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:21:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:21:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:21:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:21:59,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:21:59,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:59,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:21:59,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:21:59,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:21:59,891 INFO L130 PetriNetUnfolder]: 275/504 cut-off events. [2022-12-06 04:21:59,891 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 04:21:59,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 504 events. 275/504 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2164 event pairs, 35 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 980. Up to 385 conditions per place. [2022-12-06 04:21:59,897 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 22 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2022-12-06 04:21:59,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 120 flow [2022-12-06 04:21:59,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:21:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:21:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:21:59,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 04:21:59,908 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:21:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 120 flow [2022-12-06 04:21:59,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:21:59,913 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2022-12-06 04:21:59,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2022-12-06 04:21:59,917 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2022-12-06 04:21:59,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:21:59,918 INFO L89 Accepts]: Start accepts. Operand has 26 places, 17 transitions, 42 flow [2022-12-06 04:21:59,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:21:59,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:21:59,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 42 flow [2022-12-06 04:21:59,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2022-12-06 04:21:59,928 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:21:59,929 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:21:59,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:21:59,929 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 42 flow [2022-12-06 04:21:59,929 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 04:21:59,990 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:21:59,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 04:21:59,992 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2022-12-06 04:21:59,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:21:59,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:21:59,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:21:59,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:21:59,995 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:21:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:21:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1840485257, now seen corresponding path program 1 times [2022-12-06 04:21:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:21:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395197329] [2022-12-06 04:21:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:21:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:00,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:00,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395197329] [2022-12-06 04:22:00,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395197329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:00,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:00,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:00,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955499381] [2022-12-06 04:22:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:00,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:22:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:00,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:22:00,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:22:00,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:22:00,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:00,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:00,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:22:00,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:00,529 INFO L130 PetriNetUnfolder]: 193/338 cut-off events. [2022-12-06 04:22:00,529 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:22:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 338 events. 193/338 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1133 event pairs, 65 based on Foata normal form. 12/350 useless extension candidates. Maximal degree in co-relation 702. Up to 243 conditions per place. [2022-12-06 04:22:00,532 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-06 04:22:00,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 104 flow [2022-12-06 04:22:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 04:22:00,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2022-12-06 04:22:00,533 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 25 transitions. [2022-12-06 04:22:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 104 flow [2022-12-06 04:22:00,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:00,534 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2022-12-06 04:22:00,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-06 04:22:00,535 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2022-12-06 04:22:00,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:00,535 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 46 flow [2022-12-06 04:22:00,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:00,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:00,536 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2022-12-06 04:22:00,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2022-12-06 04:22:00,539 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-06 04:22:00,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:22:00,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:22:00,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2022-12-06 04:22:00,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:22:00,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:00,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-06 04:22:00,678 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2022-12-06 04:22:00,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:00,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:00,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:00,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:22:00,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1220290454, now seen corresponding path program 1 times [2022-12-06 04:22:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:00,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532796254] [2022-12-06 04:22:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:00,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532796254] [2022-12-06 04:22:00,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532796254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:00,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:00,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:22:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675502526] [2022-12-06 04:22:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:00,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:22:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:22:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:22:00,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:22:00,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:00,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:00,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:22:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:01,106 INFO L130 PetriNetUnfolder]: 145/260 cut-off events. [2022-12-06 04:22:01,106 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 04:22:01,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 260 events. 145/260 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 856 event pairs, 64 based on Foata normal form. 12/272 useless extension candidates. Maximal degree in co-relation 576. Up to 153 conditions per place. [2022-12-06 04:22:01,113 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 22 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-06 04:22:01,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 24 transitions, 113 flow [2022-12-06 04:22:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:22:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:22:01,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 04:22:01,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 04:22:01,115 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 3 states and 25 transitions. [2022-12-06 04:22:01,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 24 transitions, 113 flow [2022-12-06 04:22:01,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:01,116 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-06 04:22:01,117 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2022-12-06 04:22:01,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:01,117 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:01,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:01,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,123 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 04:22:01,123 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:22:01,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 16 events. 0/16 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:22:01,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:22:01,125 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:01,126 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 04:22:01,126 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 48 flow [2022-12-06 04:22:01,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:01,126 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:01,126 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:01,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:22:01,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:01,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1708443485, now seen corresponding path program 1 times [2022-12-06 04:22:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:01,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958443128] [2022-12-06 04:22:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958443128] [2022-12-06 04:22:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958443128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:02,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:02,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:22:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363053800] [2022-12-06 04:22:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:02,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:22:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:22:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:22:02,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 04:22:02,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 48 flow. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:02,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:02,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 04:22:02,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:02,286 INFO L130 PetriNetUnfolder]: 176/314 cut-off events. [2022-12-06 04:22:02,286 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:22:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 314 events. 176/314 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1141 event pairs, 15 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 725. Up to 228 conditions per place. [2022-12-06 04:22:02,288 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 31 selfloop transitions, 12 changer transitions 0/43 dead transitions. [2022-12-06 04:22:02,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 43 transitions, 200 flow [2022-12-06 04:22:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 04:22:02,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 04:22:02,289 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 48 flow. Second operand 6 states and 45 transitions. [2022-12-06 04:22:02,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 43 transitions, 200 flow [2022-12-06 04:22:02,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 43 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:02,291 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 126 flow [2022-12-06 04:22:02,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-06 04:22:02,291 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2022-12-06 04:22:02,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:02,291 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 126 flow [2022-12-06 04:22:02,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:02,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:02,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 126 flow [2022-12-06 04:22:02,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 126 flow [2022-12-06 04:22:02,303 INFO L130 PetriNetUnfolder]: 25/92 cut-off events. [2022-12-06 04:22:02,303 INFO L131 PetriNetUnfolder]: For 54/61 co-relation queries the response was YES. [2022-12-06 04:22:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 92 events. 25/92 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 399 event pairs, 9 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 241. Up to 37 conditions per place. [2022-12-06 04:22:02,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 126 flow [2022-12-06 04:22:02,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 04:22:02,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} 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-06 04:22:02,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:22:03,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:03,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1033 [2022-12-06 04:22:03,324 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 132 flow [2022-12-06 04:22:03,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:03,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:03,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:03,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:22:03,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1077525923, now seen corresponding path program 2 times [2022-12-06 04:22:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:03,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091970067] [2022-12-06 04:22:03,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091970067] [2022-12-06 04:22:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091970067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:03,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:22:03,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058215843] [2022-12-06 04:22:03,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:03,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:22:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:22:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:22:03,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:22:03,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 132 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:03,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:03,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:22:03,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:04,028 INFO L130 PetriNetUnfolder]: 151/272 cut-off events. [2022-12-06 04:22:04,028 INFO L131 PetriNetUnfolder]: For 282/282 co-relation queries the response was YES. [2022-12-06 04:22:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 272 events. 151/272 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 939 event pairs, 27 based on Foata normal form. 6/278 useless extension candidates. Maximal degree in co-relation 881. Up to 214 conditions per place. [2022-12-06 04:22:04,030 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 25 selfloop transitions, 18 changer transitions 0/43 dead transitions. [2022-12-06 04:22:04,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 291 flow [2022-12-06 04:22:04,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-06 04:22:04,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 04:22:04,032 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 132 flow. Second operand 6 states and 42 transitions. [2022-12-06 04:22:04,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 291 flow [2022-12-06 04:22:04,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 291 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:22:04,036 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 04:22:04,038 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2022-12-06 04:22:04,038 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:04,038 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:04,039 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:04,039 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,052 INFO L130 PetriNetUnfolder]: 32/102 cut-off events. [2022-12-06 04:22:04,052 INFO L131 PetriNetUnfolder]: For 153/168 co-relation queries the response was YES. [2022-12-06 04:22:04,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 102 events. 32/102 cut-off events. For 153/168 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 418 event pairs, 11 based on Foata normal form. 4/99 useless extension candidates. Maximal degree in co-relation 364. Up to 39 conditions per place. [2022-12-06 04:22:04,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 04:22:04,054 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:04,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:22:04,056 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 249 flow [2022-12-06 04:22:04,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:04,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:04,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:04,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:22:04,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 481844109, now seen corresponding path program 1 times [2022-12-06 04:22:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072269641] [2022-12-06 04:22:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:04,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:04,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072269641] [2022-12-06 04:22:04,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072269641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:04,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:04,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:22:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757543729] [2022-12-06 04:22:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:22:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:04,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:22:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:22:04,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:22:04,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 249 flow. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:04,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:04,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:22:04,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:05,016 INFO L130 PetriNetUnfolder]: 159/287 cut-off events. [2022-12-06 04:22:05,016 INFO L131 PetriNetUnfolder]: For 635/635 co-relation queries the response was YES. [2022-12-06 04:22:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 287 events. 159/287 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1036 event pairs, 19 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 1198. Up to 218 conditions per place. [2022-12-06 04:22:05,018 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 29 selfloop transitions, 23 changer transitions 0/52 dead transitions. [2022-12-06 04:22:05,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 476 flow [2022-12-06 04:22:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 04:22:05,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-06 04:22:05,020 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 249 flow. Second operand 6 states and 45 transitions. [2022-12-06 04:22:05,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 476 flow [2022-12-06 04:22:05,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 457 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:22:05,023 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2022-12-06 04:22:05,023 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2022-12-06 04:22:05,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:05,023 INFO L89 Accepts]: Start accepts. Operand has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:05,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:05,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,040 INFO L130 PetriNetUnfolder]: 42/123 cut-off events. [2022-12-06 04:22:05,040 INFO L131 PetriNetUnfolder]: For 311/319 co-relation queries the response was YES. [2022-12-06 04:22:05,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 123 events. 42/123 cut-off events. For 311/319 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 538 event pairs, 6 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 497. Up to 45 conditions per place. [2022-12-06 04:22:05,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 04:22:05,058 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:05,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 04:22:05,059 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 385 flow [2022-12-06 04:22:05,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:05,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:05,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:05,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:22:05,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2052262488, now seen corresponding path program 1 times [2022-12-06 04:22:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864930189] [2022-12-06 04:22:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:05,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864930189] [2022-12-06 04:22:05,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864930189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:05,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:05,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:22:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114505642] [2022-12-06 04:22:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:05,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:22:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:22:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:22:05,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:22:05,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 385 flow. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:05,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:05,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:22:05,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:05,673 INFO L130 PetriNetUnfolder]: 237/428 cut-off events. [2022-12-06 04:22:05,674 INFO L131 PetriNetUnfolder]: For 1428/1428 co-relation queries the response was YES. [2022-12-06 04:22:05,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 428 events. 237/428 cut-off events. For 1428/1428 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1792 event pairs, 61 based on Foata normal form. 9/437 useless extension candidates. Maximal degree in co-relation 1859. Up to 232 conditions per place. [2022-12-06 04:22:05,676 INFO L137 encePairwiseOnDemand]: 6/19 looper letters, 40 selfloop transitions, 34 changer transitions 6/80 dead transitions. [2022-12-06 04:22:05,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 779 flow [2022-12-06 04:22:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 04:22:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 04:22:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 68 transitions. [2022-12-06 04:22:05,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3253588516746411 [2022-12-06 04:22:05,678 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 385 flow. Second operand 11 states and 68 transitions. [2022-12-06 04:22:05,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 779 flow [2022-12-06 04:22:05,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 741 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:05,682 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 593 flow [2022-12-06 04:22:05,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=593, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2022-12-06 04:22:05,682 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 30 predicate places. [2022-12-06 04:22:05,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:05,683 INFO L89 Accepts]: Start accepts. Operand has 58 places, 58 transitions, 593 flow [2022-12-06 04:22:05,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:05,683 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:05,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 58 transitions, 593 flow [2022-12-06 04:22:05,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 593 flow [2022-12-06 04:22:05,724 INFO L130 PetriNetUnfolder]: 68/174 cut-off events. [2022-12-06 04:22:05,725 INFO L131 PetriNetUnfolder]: For 663/667 co-relation queries the response was YES. [2022-12-06 04:22:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 174 events. 68/174 cut-off events. For 663/667 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 817 event pairs, 8 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 804. Up to 62 conditions per place. [2022-12-06 04:22:05,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 58 transitions, 593 flow [2022-12-06 04:22:05,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 04:22:05,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] L749-->L765: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd1~0_76 256) 0)) (.cse8 (= 0 (mod v_~x$r_buff0_thd1~0_78 256)))) (let ((.cse9 (not .cse8)) (.cse6 (and (= (mod v_~x$w_buff1_used~0_189 256) 0) .cse8)) (.cse7 (and .cse8 .cse4)) (.cse12 (= (mod v_~x$w_buff0_used~0_212 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse10 v_~x~0_176 (ite .cse11 v_~x$w_buff0~0_104 v_~x$w_buff1~0_105))) (.cse3 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse5 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0)))) (and (= v_~x$mem_tmp~0_56 v_~x~0_176) (= .cse0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$w_buff1~0_105 v_~x$w_buff1~0_104) (= (ite .cse1 v_~x$mem_tmp~0_56 .cse0) v_~x~0_175) (= v_~x$r_buff1_thd1~0_75 (ite .cse1 v_~x$r_buff1_thd1~0_76 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_77 256) 0))) (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5)) v_~x$r_buff1_thd1~0_76 0))) (= (ite .cse1 v_~x$w_buff1_used~0_189 (ite (or .cse5 .cse6 .cse7) v_~x$w_buff1_used~0_189 0)) v_~x$w_buff1_used~0_188) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse1 v_~x$r_buff0_thd1~0_78 (ite (or (and .cse3 .cse8) .cse5 .cse7) v_~x$r_buff0_thd1~0_78 (ite (and .cse9 (not .cse5)) 0 v_~x$r_buff0_thd1~0_78))) v_~x$r_buff0_thd1~0_77) (= v_~x$flush_delayed~0_89 0) (= |v_P0Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_21) (= v_~x$w_buff0_used~0_211 (ite .cse1 v_~x$w_buff0_used~0_212 (ite .cse10 v_~x$w_buff0_used~0_212 (ite .cse11 0 v_~x$w_buff0_used~0_212)))) (= |v_P0Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_92)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_78, ~x$w_buff1~0=v_~x$w_buff1~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_189, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_76, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_1|, ~x~0=v_~x~0_176, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_77, ~x$flush_delayed~0=v_~x$flush_delayed~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_75, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_175} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] and [455] $Ultimate##0-->L796: Formula: (and (= v_~x$r_buff0_thd1~0_195 v_~x$r_buff1_thd1~0_205) (= v_~y~0_76 1) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_58) (= v_~x$w_buff0_used~0_507 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= 2 v_~x$w_buff0~0_331) (= v_~x$w_buff0~0_332 v_~x$w_buff1~0_302) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_216 1) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_241) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_217 v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0_used~0_508 v_~x$w_buff1_used~0_446)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_332, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_241, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-06 04:22:06,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} 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 [455] $Ultimate##0-->L796: Formula: (and (= v_~x$r_buff0_thd1~0_195 v_~x$r_buff1_thd1~0_205) (= v_~y~0_76 1) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_58) (= v_~x$w_buff0_used~0_507 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= 2 v_~x$w_buff0~0_331) (= v_~x$w_buff0~0_332 v_~x$w_buff1~0_302) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_216 1) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_241) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_217 v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0_used~0_508 v_~x$w_buff1_used~0_446)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_332, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_241, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] [2022-12-06 04:22:06,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L796: Formula: (and (= v_~x$r_buff0_thd1~0_195 v_~x$r_buff1_thd1~0_205) (= v_~y~0_76 1) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_58) (= v_~x$w_buff0_used~0_507 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= 2 v_~x$w_buff0~0_331) (= v_~x$w_buff0~0_332 v_~x$w_buff1~0_302) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_216 1) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_241) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_217 v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0_used~0_508 v_~x$w_buff1_used~0_446)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_332, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_241, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [457] L749-->L772: Formula: (let ((.cse17 (= (mod v_~x$r_buff1_thd1~0_247 256) 0)) (.cse19 (= (mod v_~x$r_buff0_thd1~0_231 256) 0))) (let ((.cse21 (not .cse19)) (.cse20 (and .cse17 .cse19)) (.cse23 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse22 (and .cse19 (= (mod v_~x$w_buff1_used~0_508 256) 0)))) (let ((.cse7 (not (= (mod v_~weak$$choice2~0_168 256) 0))) (.cse11 (or .cse20 .cse23 .cse22)) (.cse12 (and (not .cse23) .cse21))) (let ((.cse1 (ite .cse7 v_~x$w_buff0_used~0_579 (ite .cse11 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))))) (let ((.cse18 (= (mod .cse1 256) 0))) (let ((.cse4 (ite .cse7 v_~x$w_buff1_used~0_508 (ite (or .cse20 .cse22 .cse18) v_~x$w_buff1_used~0_508 0)))) (let ((.cse13 (= (mod .cse4 256) 0)) (.cse15 (not .cse18))) (let ((.cse5 (ite .cse7 v_~x$r_buff0_thd1~0_231 (ite (or (and .cse13 .cse19) .cse20 .cse18) v_~x$r_buff0_thd1~0_231 (ite (and .cse15 .cse21) 0 v_~x$r_buff0_thd1~0_231))))) (let ((.cse16 (= (mod .cse5 256) 0))) (let ((.cse10 (ite .cse7 v_~x$r_buff1_thd1~0_247 (ite (or (and .cse13 .cse16) (and .cse17 .cse16) .cse18) v_~x$r_buff1_thd1~0_247 0)))) (let ((.cse9 (not (= (mod .cse10 256) 0))) (.cse14 (not .cse16)) (.cse8 (not (= (mod v_~x$w_buff0_used~0_577 256) 0)))) (let ((.cse2 (and .cse14 .cse8)) (.cse0 (and .cse14 .cse15)) (.cse3 (and (not .cse13) .cse9)) (.cse6 (ite .cse11 v_~x~0_466 (ite .cse12 v_~x$w_buff0~0_382 v_~x$w_buff1~0_343)))) (and (= (ite .cse0 0 .cse1) v_~x$w_buff0_used~0_577) (= v_~x$w_buff1_used~0_506 (ite (or .cse2 .cse3) 0 .cse4)) (= v_~x$w_buff0~0_382 v_~x$w_buff0~0_381) (= v_~x~0_466 v_~x$mem_tmp~0_132) (= v_~x$r_buff0_thd1~0_229 (ite .cse2 0 .cse5)) (= v_~x$flush_delayed~0_161 0) (= v_~__unbuffered_p0_EAX~0_82 .cse6) (= |v_P0Thread1of1ForFork0_#t~nondet3_42| v_~weak$$choice0~0_97) (= (ite .cse0 v_~x$w_buff0~0_381 (ite .cse3 v_~x$w_buff1~0_342 (ite .cse7 v_~x$mem_tmp~0_132 .cse6))) v_~x~0_464) (= |v_P0Thread1of1ForFork0_#t~nondet4_42| v_~weak$$choice2~0_168) (= v_~x$w_buff1~0_343 v_~x$w_buff1~0_342) (= v_~x$r_buff1_thd1~0_245 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_229 256) 0)) .cse8) (and (not (= (mod v_~x$w_buff1_used~0_506 256) 0)) .cse9)) 0 .cse10))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_382, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_231, ~x$w_buff1~0=v_~x$w_buff1~0_343, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_508, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_247, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_42|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_42|, ~x~0=v_~x~0_466, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_381, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_229, ~x$flush_delayed~0=v_~x$flush_delayed~0_161, ~x$w_buff1~0=v_~x$w_buff1~0_342, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_506, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_245, ~x$mem_tmp~0=v_~x$mem_tmp~0_132, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_577, ~weak$$choice0~0=v_~weak$$choice0~0_97, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_168, ~x~0=v_~x~0_464} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~x~0] [2022-12-06 04:22:06,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L796: Formula: (and (= v_~x$r_buff0_thd1~0_195 v_~x$r_buff1_thd1~0_205) (= v_~y~0_76 1) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_58) (= v_~x$w_buff0_used~0_507 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= 2 v_~x$w_buff0~0_331) (= v_~x$w_buff0~0_332 v_~x$w_buff1~0_302) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_216 1) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_241) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_217 v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0_used~0_508 v_~x$w_buff1_used~0_446)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_332, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_241, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0] and [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} 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-06 04:22:07,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L742: Formula: (and (= v_~x~0_302 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_302, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} 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-06 04:22:07,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L742: Formula: (and (= v_~x~0_302 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_302, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [363] L796-->L812: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd2~0_56 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_63 256) 0))) (let ((.cse10 (not .cse9)) (.cse1 (and .cse9 .cse8)) (.cse2 (and (= (mod v_~x$w_buff1_used~0_181 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_52 v_~__unbuffered_p1_EBX~0_22) v_~x~0_163) (= v_~x$w_buff0~0_96 v_~x$w_buff0~0_95) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_19) (= v_~x$mem_tmp~0_52 v_~x~0_165) (= (ite .cse0 v_~x$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_181 0)) v_~x$w_buff1_used~0_180) (= v_~x$w_buff1~0_97 v_~x$w_buff1~0_96) (= v_~x$w_buff0_used~0_203 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (= v_~x$r_buff1_thd2~0_55 (ite .cse0 v_~x$r_buff1_thd2~0_56 (ite (let ((.cse6 (= (mod v_~x$r_buff0_thd2~0_62 256) 0))) (or (and .cse6 .cse7) (and .cse6 .cse8) .cse3)) v_~x$r_buff1_thd2~0_56 0))) (= v_~__unbuffered_p1_EBX~0_22 (ite .cse4 v_~x~0_165 (ite .cse5 v_~x$w_buff0~0_96 v_~x$w_buff1~0_97))) (= v_~x$r_buff0_thd2~0_62 (ite .cse0 v_~x$r_buff0_thd2~0_63 (ite (or .cse1 .cse3 (and .cse7 .cse9)) v_~x$r_buff0_thd2~0_63 (ite (and (not .cse3) .cse10) 0 v_~x$r_buff0_thd2~0_63)))) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_96, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_56, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~x~0=v_~x~0_165, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~x~0=v_~x~0_163} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet6#1, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:22:07,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L742: Formula: (and (= v_~x~0_302 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_302, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [364] L812-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_52 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_59 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_191 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_192 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_171 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_192) v_~x$w_buff0_used~0_191) (= v_~x$w_buff1_used~0_170 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_171)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_170 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_58 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_52) v_~x$r_buff1_thd2~0_51) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_59) v_~x$r_buff0_thd2~0_58) (= (ite .cse0 v_~x$w_buff0~0_85 (ite .cse2 v_~x$w_buff1~0_88 v_~x~0_156)) v_~x~0_155)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_192} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_85, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_170, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_191} 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-06 04:22:07,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L742: Formula: (and (= v_~x~0_302 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_302, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [265] L844-->L850: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_52 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_175 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_56 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_176 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_56) v_~x$r_buff0_thd0~0_55) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_155) v_~x$w_buff1_used~0_154) (= (ite .cse2 v_~x$w_buff0~0_73 (ite .cse1 v_~x$w_buff1~0_76 v_~x~0_136)) v_~x~0_135) (= (ite .cse2 0 v_~x$w_buff0_used~0_176) v_~x$w_buff0_used~0_175) (= v_~x$r_buff1_thd0~0_51 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_52))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x~0=v_~x~0_136, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_73, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_51, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175} 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-06 04:22:07,525 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:22:07,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1843 [2022-12-06 04:22:07,526 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 620 flow [2022-12-06 04:22:07,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:07,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:07,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:07,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:22:07,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:07,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2052082998, now seen corresponding path program 2 times [2022-12-06 04:22:07,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:07,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832627180] [2022-12-06 04:22:07,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:07,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832627180] [2022-12-06 04:22:07,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832627180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:07,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:07,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:22:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686668529] [2022-12-06 04:22:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:07,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:22:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:22:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:22:07,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:22:07,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 620 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:07,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:07,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:22:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:08,136 INFO L130 PetriNetUnfolder]: 206/376 cut-off events. [2022-12-06 04:22:08,137 INFO L131 PetriNetUnfolder]: For 2230/2230 co-relation queries the response was YES. [2022-12-06 04:22:08,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 376 events. 206/376 cut-off events. For 2230/2230 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1545 event pairs, 55 based on Foata normal form. 9/385 useless extension candidates. Maximal degree in co-relation 2003. Up to 279 conditions per place. [2022-12-06 04:22:08,140 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 48 selfloop transitions, 18 changer transitions 3/69 dead transitions. [2022-12-06 04:22:08,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 859 flow [2022-12-06 04:22:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:22:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:22:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 04:22:08,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27011494252873564 [2022-12-06 04:22:08,141 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 620 flow. Second operand 6 states and 47 transitions. [2022-12-06 04:22:08,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 859 flow [2022-12-06 04:22:08,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 757 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-12-06 04:22:08,145 INFO L231 Difference]: Finished difference. Result has 54 places, 56 transitions, 583 flow [2022-12-06 04:22:08,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=583, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2022-12-06 04:22:08,146 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 26 predicate places. [2022-12-06 04:22:08,146 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:08,146 INFO L89 Accepts]: Start accepts. Operand has 54 places, 56 transitions, 583 flow [2022-12-06 04:22:08,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:08,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:08,147 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 583 flow [2022-12-06 04:22:08,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 583 flow [2022-12-06 04:22:08,168 INFO L130 PetriNetUnfolder]: 73/188 cut-off events. [2022-12-06 04:22:08,168 INFO L131 PetriNetUnfolder]: For 817/838 co-relation queries the response was YES. [2022-12-06 04:22:08,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 188 events. 73/188 cut-off events. For 817/838 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 919 event pairs, 12 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 853. Up to 65 conditions per place. [2022-12-06 04:22:08,170 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 583 flow [2022-12-06 04:22:08,170 INFO L188 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-06 04:22:08,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L742: Formula: (and (= v_~x~0_302 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~x~0=v_~x~0_302, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [462] $Ultimate##0-->L749: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_637 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_258 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_639 256) 0))) (let ((.cse2 (and .cse0 (not .cse4))) (.cse3 (and .cse0 .cse1))) (and (= v_~x$r_buff0_thd2~0_296 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_69| |v_P1Thread1of1ForFork1_~arg#1.offset_69|) (= v_~x$r_buff1_thd1~0_275 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_564 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_257 256) 0)))) 0 v_~x$r_buff0_thd1~0_258)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff0_used~0_639) v_~x$w_buff1_used~0_564) (= v_~x$r_buff0_thd0~0_295 v_~x$r_buff1_thd0~0_299) (= (ite .cse0 v_~x$w_buff0~0_421 (ite .cse2 v_~x$w_buff1~0_380 v_~x~0_519)) v_~x~0_518) (= v_~y~0_100 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_69| |v_P1Thread1of1ForFork1_~arg#1.base_69|) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81|) (= v_~x$w_buff0~0_422 v_~x$w_buff1~0_380) (= v_~x$w_buff0_used~0_637 (ite .cse0 0 1)) (= v_~y~0_100 v_~__unbuffered_p1_EAX~0_84) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81| 0)) (= v_~x$r_buff0_thd2~0_297 v_~x$r_buff1_thd2~0_219) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81|) (= 2 v_~x$w_buff0~0_421) (= v_~x$r_buff0_thd1~0_257 (ite .cse3 0 v_~x$r_buff0_thd1~0_258))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_422, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_69|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_258, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_297, ~x~0=v_~x~0_519, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_639, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_69|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_421, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_257, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_69|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_69|, ~x$w_buff1~0=v_~x$w_buff1~0_380, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_564, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_219, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_296, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_299, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_81|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_637, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_69|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_69|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_81|, ~y~0=v_~y~0_100, ~x~0=v_~x~0_518} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0, ~x~0] [2022-12-06 04:22:08,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:08,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 04:22:08,340 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 585 flow [2022-12-06 04:22:08,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:08,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:08,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:08,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:22:08,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:08,341 INFO L85 PathProgramCache]: Analyzing trace with hash 864546857, now seen corresponding path program 1 times [2022-12-06 04:22:08,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:08,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396870852] [2022-12-06 04:22:08,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:08,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:08,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396870852] [2022-12-06 04:22:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396870852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:08,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:22:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842041632] [2022-12-06 04:22:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:08,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:22:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:08,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:22:08,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:22:08,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:22:08,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 585 flow. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:08,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:08,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:22:08,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:08,910 INFO L130 PetriNetUnfolder]: 213/382 cut-off events. [2022-12-06 04:22:08,911 INFO L131 PetriNetUnfolder]: For 1785/1785 co-relation queries the response was YES. [2022-12-06 04:22:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2046 conditions, 382 events. 213/382 cut-off events. For 1785/1785 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1554 event pairs, 28 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 2019. Up to 347 conditions per place. [2022-12-06 04:22:08,916 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 56 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2022-12-06 04:22:08,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 917 flow [2022-12-06 04:22:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:22:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:22:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 04:22:08,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 04:22:08,917 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 585 flow. Second operand 5 states and 42 transitions. [2022-12-06 04:22:08,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 917 flow [2022-12-06 04:22:08,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 884 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 04:22:08,921 INFO L231 Difference]: Finished difference. Result has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=743, PETRI_PLACES=56, PETRI_TRANSITIONS=65} [2022-12-06 04:22:08,921 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 28 predicate places. [2022-12-06 04:22:08,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:08,921 INFO L89 Accepts]: Start accepts. Operand has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:08,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:08,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,947 INFO L130 PetriNetUnfolder]: 77/202 cut-off events. [2022-12-06 04:22:08,947 INFO L131 PetriNetUnfolder]: For 847/854 co-relation queries the response was YES. [2022-12-06 04:22:08,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 202 events. 77/202 cut-off events. For 847/854 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1020 event pairs, 8 based on Foata normal form. 4/199 useless extension candidates. Maximal degree in co-relation 1011. Up to 69 conditions per place. [2022-12-06 04:22:08,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 04:22:08,950 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:22:08,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:22:08,950 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 65 transitions, 743 flow [2022-12-06 04:22:08,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:08,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:08,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:08,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:22:08,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 630444190, now seen corresponding path program 1 times [2022-12-06 04:22:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850931941] [2022-12-06 04:22:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:09,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850931941] [2022-12-06 04:22:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850931941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:22:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001830713] [2022-12-06 04:22:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:22:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:22:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:22:09,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:22:09,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 65 transitions, 743 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:09,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:09,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:22:09,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:09,488 INFO L130 PetriNetUnfolder]: 225/405 cut-off events. [2022-12-06 04:22:09,488 INFO L131 PetriNetUnfolder]: For 2244/2244 co-relation queries the response was YES. [2022-12-06 04:22:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 405 events. 225/405 cut-off events. For 2244/2244 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1713 event pairs, 36 based on Foata normal form. 4/409 useless extension candidates. Maximal degree in co-relation 2272. Up to 288 conditions per place. [2022-12-06 04:22:09,504 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 36 selfloop transitions, 39 changer transitions 0/75 dead transitions. [2022-12-06 04:22:09,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 967 flow [2022-12-06 04:22:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:22:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:22:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 04:22:09,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 04:22:09,507 INFO L175 Difference]: Start difference. First operand has 56 places, 65 transitions, 743 flow. Second operand 5 states and 42 transitions. [2022-12-06 04:22:09,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 967 flow [2022-12-06 04:22:09,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 956 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 04:22:09,513 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 901 flow [2022-12-06 04:22:09,514 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=901, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2022-12-06 04:22:09,514 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 32 predicate places. [2022-12-06 04:22:09,514 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:09,514 INFO L89 Accepts]: Start accepts. Operand has 60 places, 69 transitions, 901 flow [2022-12-06 04:22:09,515 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:09,515 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:09,515 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 69 transitions, 901 flow [2022-12-06 04:22:09,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 69 transitions, 901 flow [2022-12-06 04:22:09,599 INFO L130 PetriNetUnfolder]: 94/228 cut-off events. [2022-12-06 04:22:09,599 INFO L131 PetriNetUnfolder]: For 1512/1543 co-relation queries the response was YES. [2022-12-06 04:22:09,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 228 events. 94/228 cut-off events. For 1512/1543 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1131 event pairs, 13 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 1323. Up to 99 conditions per place. [2022-12-06 04:22:09,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 69 transitions, 901 flow [2022-12-06 04:22:09,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 04:22:10,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:10,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 570 [2022-12-06 04:22:10,084 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 923 flow [2022-12-06 04:22:10,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:10,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:10,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:10,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:22:10,085 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 04:22:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash 968524145, now seen corresponding path program 1 times [2022-12-06 04:22:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:10,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303106343] [2022-12-06 04:22:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303106343] [2022-12-06 04:22:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303106343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:11,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:11,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:22:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560509339] [2022-12-06 04:22:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:11,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:22:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:22:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:22:11,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:22:11,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 923 flow. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:11,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:11,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:22:11,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:11,447 INFO L130 PetriNetUnfolder]: 254/473 cut-off events. [2022-12-06 04:22:11,448 INFO L131 PetriNetUnfolder]: For 3344/3344 co-relation queries the response was YES. [2022-12-06 04:22:11,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 473 events. 254/473 cut-off events. For 3344/3344 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2151 event pairs, 34 based on Foata normal form. 4/477 useless extension candidates. Maximal degree in co-relation 2932. Up to 374 conditions per place. [2022-12-06 04:22:11,454 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 49 selfloop transitions, 38 changer transitions 8/95 dead transitions. [2022-12-06 04:22:11,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 1299 flow [2022-12-06 04:22:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 04:22:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 04:22:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2022-12-06 04:22:11,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2413793103448276 [2022-12-06 04:22:11,455 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 923 flow. Second operand 9 states and 63 transitions. [2022-12-06 04:22:11,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 1299 flow [2022-12-06 04:22:11,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 1284 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:22:11,466 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 975 flow [2022-12-06 04:22:11,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=975, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2022-12-06 04:22:11,467 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 41 predicate places. [2022-12-06 04:22:11,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:11,467 INFO L89 Accepts]: Start accepts. Operand has 69 places, 67 transitions, 975 flow [2022-12-06 04:22:11,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:11,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:11,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 975 flow [2022-12-06 04:22:11,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 975 flow [2022-12-06 04:22:11,508 INFO L130 PetriNetUnfolder]: 91/225 cut-off events. [2022-12-06 04:22:11,508 INFO L131 PetriNetUnfolder]: For 1569/1577 co-relation queries the response was YES. [2022-12-06 04:22:11,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 225 events. 91/225 cut-off events. For 1569/1577 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1163 event pairs, 16 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 1373. Up to 91 conditions per place. [2022-12-06 04:22:11,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 975 flow [2022-12-06 04:22:11,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 04:22:11,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [461] $Ultimate##0-->L772: Formula: (let ((.cse7 (= (mod v_~x$w_buff0_used~0_633 256) 0)) (.cse19 (= (mod v_~x$r_buff0_thd1~0_254 256) 0))) (let ((.cse20 (and .cse7 .cse19))) (let ((.cse3 (not (= (mod v_~weak$$choice2~0_180 256) 0))) (.cse15 (or .cse20 .cse19)) (.cse16 (not .cse19))) (let ((.cse4 (ite .cse3 1 (ite .cse15 1 (ite .cse16 0 1))))) (let ((.cse18 (= (mod .cse4 256) 0))) (let ((.cse8 (ite .cse3 v_~x$w_buff0_used~0_633 (ite (or .cse20 .cse18 .cse19) v_~x$w_buff0_used~0_633 0)))) (let ((.cse13 (= (mod .cse8 256) 0)) (.cse14 (not .cse18))) (let ((.cse6 (ite .cse3 v_~x$r_buff0_thd1~0_254 (ite (or .cse18 .cse19 (and .cse13 .cse19)) v_~x$r_buff0_thd1~0_254 (ite (and .cse14 .cse16) 0 v_~x$r_buff0_thd1~0_254))))) (let ((.cse17 (= (mod .cse6 256) 0))) (let ((.cse11 (ite .cse3 v_~x$r_buff0_thd1~0_254 (ite (or .cse18 (and .cse13 .cse17) (and .cse17 .cse19)) v_~x$r_buff0_thd1~0_254 0)))) (let ((.cse10 (not (= (mod v_~x$w_buff0_used~0_631 256) 0))) (.cse9 (not (= (mod .cse11 256) 0))) (.cse12 (not .cse17))) (let ((.cse0 (ite .cse15 v_~x~0_515 (ite .cse16 v_~x$w_buff0~0_415 v_~x$w_buff0~0_417))) (.cse1 (and .cse14 .cse12)) (.cse2 (and .cse9 (not .cse13))) (.cse5 (and .cse12 .cse10))) (and (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_67| |v_P1Thread1of1ForFork1_~arg#1.offset_67|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| 0)) (= |v_P0Thread1of1ForFork0_#t~nondet3_54| v_~weak$$choice0~0_109) (= .cse0 v_~__unbuffered_p0_EAX~0_88) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|) (= (ite .cse1 v_~x$w_buff0~0_415 (ite .cse2 v_~x$w_buff1~0_376 (ite .cse3 v_~x$mem_tmp~0_144 .cse0))) v_~x~0_514) (= v_~x~0_515 v_~x$mem_tmp~0_144) (= v_~x$r_buff0_thd2~0_293 v_~x$r_buff1_thd2~0_217) (= 2 v_~x$w_buff0~0_415) (= (ite .cse1 0 .cse4) v_~x$w_buff0_used~0_631) (= |v_P0Thread1of1ForFork0_#t~nondet4_54| v_~weak$$choice2~0_180) (= v_~x$r_buff0_thd2~0_292 1) (= v_~x$w_buff0~0_417 v_~x$w_buff1~0_376) (= v_~y~0_98 v_~__unbuffered_p1_EAX~0_82) (= v_~x$flush_delayed~0_173 0) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_67| |v_P1Thread1of1ForFork1_~arg#1.base_67|) (= v_~x$r_buff0_thd0~0_293 v_~x$r_buff1_thd0~0_297) (= (ite .cse5 0 .cse6) v_~x$r_buff0_thd1~0_253) (= v_~y~0_98 1) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|) (= (ite (or .cse2 .cse5) 0 .cse8) v_~x$w_buff1_used~0_560) (= v_~x$r_buff1_thd1~0_271 (ite (or (and .cse9 (not (= (mod v_~x$w_buff1_used~0_560 256) 0))) (and .cse10 (not (= (mod v_~x$r_buff0_thd1~0_253 256) 0)))) 0 .cse11))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_417, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_67|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_293, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_254, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_54|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_54|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_293, ~x~0=v_~x~0_515, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_67|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_415, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_253, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_67|, ~x$flush_delayed~0=v_~x$flush_delayed~0_173, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_271, ~x$mem_tmp~0=v_~x$mem_tmp~0_144, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_67|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|, ~y~0=v_~y~0_98, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_293, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_67|, ~x$w_buff1~0=v_~x$w_buff1~0_376, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_560, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_217, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_292, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_79|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ~weak$$choice0~0=v_~weak$$choice0~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_180, ~x~0=v_~x~0_514} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0] [2022-12-06 04:22:12,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_66 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_171 256) 0))) (.cse5 (not (= 0 (mod v_~x$r_buff0_thd1~0_68 256))))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_172 256) 0)) .cse5)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_151 256) 0)) .cse2))) (and (= v_~x$r_buff0_thd1~0_67 (ite .cse0 0 v_~x$r_buff0_thd1~0_68)) (= v_~x$r_buff1_thd1~0_65 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_67 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_150 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_66)) (= v_~x$w_buff1_used~0_150 (ite (or .cse0 .cse3) 0 v_~x$w_buff1_used~0_151)) (= v_~x$w_buff0_used~0_171 (ite .cse4 0 v_~x$w_buff0_used~0_172)) (= (ite .cse4 v_~x$w_buff0~0_71 (ite .cse3 v_~x$w_buff1~0_74 v_~x~0_128)) v_~x~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_151, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_66, ~x~0=v_~x~0_128, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_71, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_150, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_65, ~x~0=v_~x~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_171} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [455] $Ultimate##0-->L796: Formula: (and (= v_~x$r_buff0_thd1~0_195 v_~x$r_buff1_thd1~0_205) (= v_~y~0_76 1) (= v_~y~0_76 v_~__unbuffered_p1_EAX~0_58) (= v_~x$w_buff0_used~0_507 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= 2 v_~x$w_buff0~0_331) (= v_~x$w_buff0~0_332 v_~x$w_buff1~0_302) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd2~0_216 1) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_241) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_217 v_~x$r_buff1_thd2~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~x$w_buff0_used~0_508 v_~x$w_buff1_used~0_446)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_332, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_217, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_195, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_302, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_241, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y~0]