/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:59,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:59,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:59,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:59,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:59,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:59,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:59,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:59,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:59,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:59,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:59,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:59,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:59,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:59,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:59,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:59,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:59,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:59,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:59,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:59,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:59,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:59,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:59,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:59,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:59,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:59,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:59,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:59,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:59,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:59,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:59,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:59,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:59,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:59,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:59,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:59,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:59,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:59,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:59,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:59,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:59,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:59,408 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:59,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:59,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:59,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:59,410 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:59,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:59,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:59,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:59,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:59,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:59,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:59,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:59,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:59,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:59,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:59,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:59,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:18:59,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:59,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:59,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:59,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:59,728 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:59,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-06 06:19:00,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:19:01,244 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:19:01,244 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-06 06:19:01,254 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e8ca337/1625557680f946039648f3dec9ec0d36/FLAG28c18ea55 [2022-12-06 06:19:01,266 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e8ca337/1625557680f946039648f3dec9ec0d36 [2022-12-06 06:19:01,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:19:01,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:19:01,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:01,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:19:01,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:19:01,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350b457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01, skipping insertion in model container [2022-12-06 06:19:01,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:19:01,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:19:01,403 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-06 06:19:01,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:01,603 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:19:01,614 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-06 06:19:01,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:01,707 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:19:01,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01 WrapperNode [2022-12-06 06:19:01,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:01,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:01,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:19:01,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:19:01,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,778 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-06 06:19:01,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:01,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:19:01,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:19:01,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:19:01,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:19:01,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:19:01,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:19:01,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:19:01,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:19:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:19:01,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:19:01,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:19:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:19:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:19:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:19:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:19:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:19:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:19:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:19:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:19:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:19:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:19:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:19:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:19:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:19:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:19:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:19:01,952 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:19:02,045 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:19:02,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:19:02,405 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:19:02,509 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:19:02,510 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:19:02,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:02 BoogieIcfgContainer [2022-12-06 06:19:02,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:19:02,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:19:02,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:19:02,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:19:02,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:19:01" (1/3) ... [2022-12-06 06:19:02,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1e8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:02, skipping insertion in model container [2022-12-06 06:19:02,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01" (2/3) ... [2022-12-06 06:19:02,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1e8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:02, skipping insertion in model container [2022-12-06 06:19:02,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:02" (3/3) ... [2022-12-06 06:19:02,519 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2022-12-06 06:19:02,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:19:02,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:19:02,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:19:02,596 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:19:02,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 06:19:02,689 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 06:19:02,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:19:02,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 06:19:02,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-06 06:19:02,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:02,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 06:19:02,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-06 06:19:02,751 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 06:19:02,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:02,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:19:02,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 06:19:02,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-06 06:19:06,628 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-06 06:19:06,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:19:06,643 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;@31e7838, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:19:06,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:19:06,646 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:19:06,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:06,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:06,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:19:06,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 445688172, now seen corresponding path program 1 times [2022-12-06 06:19:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:06,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819863074] [2022-12-06 06:19:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:06,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819863074] [2022-12-06 06:19:06,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819863074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:06,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:06,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:19:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573338777] [2022-12-06 06:19:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:07,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:19:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:19:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:19:07,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:19:07,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:07,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:07,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:19:07,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:07,263 INFO L130 PetriNetUnfolder]: 879/1388 cut-off events. [2022-12-06 06:19:07,264 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:19:07,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1388 events. 879/1388 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6538 event pairs, 240 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 2744. Up to 1060 conditions per place. [2022-12-06 06:19:07,271 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 06:19:07,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 06:19:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 06:19:07,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 06:19:07,281 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 06:19:07,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 06:19:07,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:07,284 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 06:19:07,285 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 06:19:07,288 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:19:07,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:07,288 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 06:19:07,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:07,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:07,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 06:19:07,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:19:07,295 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:19:07,295 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:07,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 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/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:19:07,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:19:07,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:19:07,365 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:07,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:19:07,366 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:19:07,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:07,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:07,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:07,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:19:07,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1482323596, now seen corresponding path program 1 times [2022-12-06 06:19:07,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:07,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696281775] [2022-12-06 06:19:07,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:07,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:07,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696281775] [2022-12-06 06:19:07,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696281775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:07,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:07,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:19:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135621537] [2022-12-06 06:19:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:19:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:19:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:19:07,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:19:07,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:07,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:07,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:19:07,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:07,648 INFO L130 PetriNetUnfolder]: 631/1016 cut-off events. [2022-12-06 06:19:07,648 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 06:19:07,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1016 events. 631/1016 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4426 event pairs, 247 based on Foata normal form. 32/1044 useless extension candidates. Maximal degree in co-relation 2092. Up to 609 conditions per place. [2022-12-06 06:19:07,653 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 06:19:07,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2022-12-06 06:19:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:19:07,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-06 06:19:07,654 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:19:07,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2022-12-06 06:19:07,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:07,655 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 06:19:07,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 06:19:07,656 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-06 06:19:07,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:07,656 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:19:07,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:07,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:07,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:19:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:19:07,660 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:19:07,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:07,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:19:07,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:19:07,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 06:19:07,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:07,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 06:19:07,734 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 06:19:07,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:07,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:07,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:07,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:19:07,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1294257034, now seen corresponding path program 1 times [2022-12-06 06:19:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:07,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037504927] [2022-12-06 06:19:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:07,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037504927] [2022-12-06 06:19:07,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037504927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:07,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:07,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200980173] [2022-12-06 06:19:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:07,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:07,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:19:07,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:07,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:07,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:19:07,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:08,031 INFO L130 PetriNetUnfolder]: 418/703 cut-off events. [2022-12-06 06:19:08,031 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 06:19:08,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 703 events. 418/703 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3171 event pairs, 112 based on Foata normal form. 64/754 useless extension candidates. Maximal degree in co-relation 1552. Up to 281 conditions per place. [2022-12-06 06:19:08,035 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 5 changer transitions 1/43 dead transitions. [2022-12-06 06:19:08,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 192 flow [2022-12-06 06:19:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-06 06:19:08,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6375 [2022-12-06 06:19:08,038 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 51 transitions. [2022-12-06 06:19:08,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 192 flow [2022-12-06 06:19:08,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:08,040 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 06:19:08,042 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 06:19:08,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:08,042 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:08,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:08,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,048 INFO L130 PetriNetUnfolder]: 14/52 cut-off events. [2022-12-06 06:19:08,048 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:19:08,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 52 events. 14/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 140 event pairs, 6 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 106. Up to 29 conditions per place. [2022-12-06 06:19:08,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:19:08,055 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:08,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:19:08,057 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 84 flow [2022-12-06 06:19:08,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:08,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:08,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:19:08,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -866279, now seen corresponding path program 1 times [2022-12-06 06:19:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:08,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755944604] [2022-12-06 06:19:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:08,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755944604] [2022-12-06 06:19:08,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755944604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792856182] [2022-12-06 06:19:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:08,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:19:08,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:19:08,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:08,404 INFO L130 PetriNetUnfolder]: 214/397 cut-off events. [2022-12-06 06:19:08,404 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 06:19:08,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1096 conditions, 397 events. 214/397 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1613 event pairs, 56 based on Foata normal form. 37/430 useless extension candidates. Maximal degree in co-relation 1083. Up to 162 conditions per place. [2022-12-06 06:19:08,406 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 43 selfloop transitions, 8 changer transitions 1/54 dead transitions. [2022-12-06 06:19:08,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 274 flow [2022-12-06 06:19:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 06:19:08,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 06:19:08,408 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 84 flow. Second operand 5 states and 64 transitions. [2022-12-06 06:19:08,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 274 flow [2022-12-06 06:19:08,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 264 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:08,409 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-06 06:19:08,410 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-06 06:19:08,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:08,410 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:08,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:08,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,416 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 06:19:08,416 INFO L131 PetriNetUnfolder]: For 28/33 co-relation queries the response was YES. [2022-12-06 06:19:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 40 events. 8/40 cut-off events. For 28/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 1 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 104. Up to 20 conditions per place. [2022-12-06 06:19:08,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:19:08,417 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:08,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:19:08,418 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 124 flow [2022-12-06 06:19:08,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:08,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:08,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:19:08,419 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1380486620, now seen corresponding path program 1 times [2022-12-06 06:19:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:08,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094884150] [2022-12-06 06:19:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094884150] [2022-12-06 06:19:08,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094884150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005554622] [2022-12-06 06:19:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:08,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:19:08,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 124 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:19:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:08,700 INFO L130 PetriNetUnfolder]: 302/552 cut-off events. [2022-12-06 06:19:08,701 INFO L131 PetriNetUnfolder]: For 556/556 co-relation queries the response was YES. [2022-12-06 06:19:08,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 552 events. 302/552 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2236 event pairs, 48 based on Foata normal form. 9/561 useless extension candidates. Maximal degree in co-relation 1684. Up to 348 conditions per place. [2022-12-06 06:19:08,704 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 59 selfloop transitions, 9 changer transitions 2/70 dead transitions. [2022-12-06 06:19:08,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 459 flow [2022-12-06 06:19:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 06:19:08,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-06 06:19:08,705 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 124 flow. Second operand 5 states and 57 transitions. [2022-12-06 06:19:08,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 459 flow [2022-12-06 06:19:08,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 70 transitions, 402 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 06:19:08,709 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-06 06:19:08,710 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-06 06:19:08,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:08,710 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:08,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:08,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,722 INFO L130 PetriNetUnfolder]: 36/136 cut-off events. [2022-12-06 06:19:08,723 INFO L131 PetriNetUnfolder]: For 56/68 co-relation queries the response was YES. [2022-12-06 06:19:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 136 events. 36/136 cut-off events. For 56/68 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 584 event pairs, 4 based on Foata normal form. 8/142 useless extension candidates. Maximal degree in co-relation 344. Up to 49 conditions per place. [2022-12-06 06:19:08,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-06 06:19:08,746 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:08,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:19:08,747 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 164 flow [2022-12-06 06:19:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:08,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:08,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:19:08,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash 275214282, now seen corresponding path program 2 times [2022-12-06 06:19:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:08,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423525238] [2022-12-06 06:19:08,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:08,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423525238] [2022-12-06 06:19:08,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423525238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801976841] [2022-12-06 06:19:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:08,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:08,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:19:08,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 164 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:19:08,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:09,070 INFO L130 PetriNetUnfolder]: 359/666 cut-off events. [2022-12-06 06:19:09,070 INFO L131 PetriNetUnfolder]: For 620/620 co-relation queries the response was YES. [2022-12-06 06:19:09,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 666 events. 359/666 cut-off events. For 620/620 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2883 event pairs, 65 based on Foata normal form. 9/675 useless extension candidates. Maximal degree in co-relation 2172. Up to 320 conditions per place. [2022-12-06 06:19:09,073 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 50 selfloop transitions, 9 changer transitions 16/75 dead transitions. [2022-12-06 06:19:09,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 492 flow [2022-12-06 06:19:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 06:19:09,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:19:09,077 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 164 flow. Second operand 6 states and 60 transitions. [2022-12-06 06:19:09,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 492 flow [2022-12-06 06:19:09,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:19:09,083 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 185 flow [2022-12-06 06:19:09,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-06 06:19:09,086 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-06 06:19:09,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:09,086 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 185 flow [2022-12-06 06:19:09,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:09,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:09,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 185 flow [2022-12-06 06:19:09,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 185 flow [2022-12-06 06:19:09,103 INFO L130 PetriNetUnfolder]: 31/126 cut-off events. [2022-12-06 06:19:09,103 INFO L131 PetriNetUnfolder]: For 91/102 co-relation queries the response was YES. [2022-12-06 06:19:09,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 126 events. 31/126 cut-off events. For 91/102 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 531 event pairs, 4 based on Foata normal form. 7/130 useless extension candidates. Maximal degree in co-relation 339. Up to 47 conditions per place. [2022-12-06 06:19:09,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 185 flow [2022-12-06 06:19:09,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:19:09,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_23 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [444] $Ultimate##0-->L809: Formula: (and (= v_~y~0_48 v_~__unbuffered_p2_EAX~0_78) (= v_P2Thread1of1ForFork1_~arg.offset_13 |v_P2Thread1of1ForFork1_#in~arg.offset_13|) (= v_P2Thread1of1ForFork1_~arg.base_13 |v_P2Thread1of1ForFork1_#in~arg.base_13|) (= v_~y~0_48 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_13|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_13, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_13|, ~y~0=v_~y~0_48} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 06:19:09,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_23 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [327] L786-->L789: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:19:09,913 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:19:09,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 828 [2022-12-06 06:19:09,914 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 189 flow [2022-12-06 06:19:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:09,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:09,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:19:09,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1343872971, now seen corresponding path program 1 times [2022-12-06 06:19:09,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:09,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817246261] [2022-12-06 06:19:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817246261] [2022-12-06 06:19:10,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817246261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:10,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:10,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:10,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244089335] [2022-12-06 06:19:10,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:10,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:10,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:10,141 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 06:19:10,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:10,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 06:19:10,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:10,270 INFO L130 PetriNetUnfolder]: 184/368 cut-off events. [2022-12-06 06:19:10,270 INFO L131 PetriNetUnfolder]: For 655/659 co-relation queries the response was YES. [2022-12-06 06:19:10,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 368 events. 184/368 cut-off events. For 655/659 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1548 event pairs, 41 based on Foata normal form. 19/381 useless extension candidates. Maximal degree in co-relation 1252. Up to 136 conditions per place. [2022-12-06 06:19:10,272 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 25 selfloop transitions, 11 changer transitions 11/50 dead transitions. [2022-12-06 06:19:10,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 350 flow [2022-12-06 06:19:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 06:19:10,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2022-12-06 06:19:10,274 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 189 flow. Second operand 6 states and 59 transitions. [2022-12-06 06:19:10,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 350 flow [2022-12-06 06:19:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 314 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 06:19:10,276 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 167 flow [2022-12-06 06:19:10,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2022-12-06 06:19:10,277 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 06:19:10,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:10,277 INFO L89 Accepts]: Start accepts. Operand has 47 places, 28 transitions, 167 flow [2022-12-06 06:19:10,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:10,279 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:10,279 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 167 flow [2022-12-06 06:19:10,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 167 flow [2022-12-06 06:19:10,286 INFO L130 PetriNetUnfolder]: 13/55 cut-off events. [2022-12-06 06:19:10,286 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2022-12-06 06:19:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 55 events. 13/55 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 1 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 170. Up to 18 conditions per place. [2022-12-06 06:19:10,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 28 transitions, 167 flow [2022-12-06 06:19:10,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 06:19:10,916 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L819-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [451] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_118 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_384 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_385 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= v_~x$r_buff0_thd0~0_124 (ite .cse0 0 v_~x$r_buff0_thd0~0_125)) (= v_~x$w_buff1_used~0_343 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_344)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= v_~main$tmp_guard1~0_78 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_89 0) (= v_~__unbuffered_p1_EAX~0_92 0) (= v_~__unbuffered_p2_EAX~0_90 1) (= v_~__unbuffered_p0_EAX~0_130 0))) 1 0) 0) 0 1)) (= (ite .cse2 0 v_~x$w_buff0_used~0_385) v_~x$w_buff0_used~0_384) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_124 256) 0)))) 0 v_~x$r_buff1_thd0~0_118) v_~x$r_buff1_thd0~0_117) (= (ite .cse2 v_~x$w_buff0~0_258 (ite .cse1 v_~x$w_buff1~0_229 v_~x~0_302)) v_~x~0_301) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_118, ~x~0=v_~x~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_385} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_55|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_384, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x~0=v_~x~0_301, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:19:11,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L796-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [451] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_118 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_384 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_385 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= v_~x$r_buff0_thd0~0_124 (ite .cse0 0 v_~x$r_buff0_thd0~0_125)) (= v_~x$w_buff1_used~0_343 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_344)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= v_~main$tmp_guard1~0_78 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_89 0) (= v_~__unbuffered_p1_EAX~0_92 0) (= v_~__unbuffered_p2_EAX~0_90 1) (= v_~__unbuffered_p0_EAX~0_130 0))) 1 0) 0) 0 1)) (= (ite .cse2 0 v_~x$w_buff0_used~0_385) v_~x$w_buff0_used~0_384) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_124 256) 0)))) 0 v_~x$r_buff1_thd0~0_118) v_~x$r_buff1_thd0~0_117) (= (ite .cse2 v_~x$w_buff0~0_258 (ite .cse1 v_~x$w_buff1~0_229 v_~x~0_302)) v_~x~0_301) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_118, ~x~0=v_~x~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_385} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_55|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_384, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x~0=v_~x~0_301, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:19:11,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [451] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_118 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_384 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_385 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_344 256) 0)) .cse3))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= v_~x$r_buff0_thd0~0_124 (ite .cse0 0 v_~x$r_buff0_thd0~0_125)) (= v_~x$w_buff1_used~0_343 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_344)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= v_~main$tmp_guard1~0_78 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_89 0) (= v_~__unbuffered_p1_EAX~0_92 0) (= v_~__unbuffered_p2_EAX~0_90 1) (= v_~__unbuffered_p0_EAX~0_130 0))) 1 0) 0) 0 1)) (= (ite .cse2 0 v_~x$w_buff0_used~0_385) v_~x$w_buff0_used~0_384) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_343 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_124 256) 0)))) 0 v_~x$r_buff1_thd0~0_118) v_~x$r_buff1_thd0~0_117) (= (ite .cse2 v_~x$w_buff0~0_258 (ite .cse1 v_~x$w_buff1~0_229 v_~x~0_302)) v_~x~0_301) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|) (= v_~main$tmp_guard0~0_76 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_118, ~x~0=v_~x~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_385} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_89, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_55|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_61|, ~x$w_buff1~0=v_~x$w_buff1~0_229, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_343, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_117, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_384, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_92, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ~x~0=v_~x~0_301, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_49|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:19:11,541 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:11,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1265 [2022-12-06 06:19:11,542 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 173 flow [2022-12-06 06:19:11,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:11,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:11,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:11,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:19:11,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash 72997227, now seen corresponding path program 1 times [2022-12-06 06:19:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:11,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737416272] [2022-12-06 06:19:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737416272] [2022-12-06 06:19:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737416272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:11,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:11,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780739754] [2022-12-06 06:19:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:11,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:11,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:11,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:19:11,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:11,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:11,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:19:11,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:12,041 INFO L130 PetriNetUnfolder]: 139/305 cut-off events. [2022-12-06 06:19:12,041 INFO L131 PetriNetUnfolder]: For 848/848 co-relation queries the response was YES. [2022-12-06 06:19:12,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 305 events. 139/305 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1416 event pairs, 26 based on Foata normal form. 6/310 useless extension candidates. Maximal degree in co-relation 1180. Up to 149 conditions per place. [2022-12-06 06:19:12,043 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 36 selfloop transitions, 8 changer transitions 18/65 dead transitions. [2022-12-06 06:19:12,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 571 flow [2022-12-06 06:19:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 06:19:12,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 06:19:12,044 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 173 flow. Second operand 6 states and 64 transitions. [2022-12-06 06:19:12,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 571 flow [2022-12-06 06:19:12,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 402 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 06:19:12,047 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 191 flow [2022-12-06 06:19:12,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-06 06:19:12,048 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 06:19:12,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:12,048 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 191 flow [2022-12-06 06:19:12,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:12,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:12,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 191 flow [2022-12-06 06:19:12,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 191 flow [2022-12-06 06:19:12,061 INFO L130 PetriNetUnfolder]: 34/110 cut-off events. [2022-12-06 06:19:12,062 INFO L131 PetriNetUnfolder]: For 250/256 co-relation queries the response was YES. [2022-12-06 06:19:12,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 110 events. 34/110 cut-off events. For 250/256 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 472 event pairs, 2 based on Foata normal form. 4/112 useless extension candidates. Maximal degree in co-relation 307. Up to 32 conditions per place. [2022-12-06 06:19:12,062 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 191 flow [2022-12-06 06:19:12,062 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 06:19:12,497 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:19:12,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 450 [2022-12-06 06:19:12,498 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 196 flow [2022-12-06 06:19:12,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:12,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:12,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:12,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:19:12,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 294787869, now seen corresponding path program 1 times [2022-12-06 06:19:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:12,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817147341] [2022-12-06 06:19:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:13,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817147341] [2022-12-06 06:19:13,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817147341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:13,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:13,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623301561] [2022-12-06 06:19:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:19:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:19:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:19:13,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:19:13,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:13,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:19:13,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:13,273 INFO L130 PetriNetUnfolder]: 110/245 cut-off events. [2022-12-06 06:19:13,274 INFO L131 PetriNetUnfolder]: For 534/544 co-relation queries the response was YES. [2022-12-06 06:19:13,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 245 events. 110/245 cut-off events. For 534/544 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1065 event pairs, 7 based on Foata normal form. 12/254 useless extension candidates. Maximal degree in co-relation 859. Up to 116 conditions per place. [2022-12-06 06:19:13,275 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 32 selfloop transitions, 11 changer transitions 10/55 dead transitions. [2022-12-06 06:19:13,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 411 flow [2022-12-06 06:19:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 06:19:13,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 06:19:13,277 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 196 flow. Second operand 6 states and 51 transitions. [2022-12-06 06:19:13,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 411 flow [2022-12-06 06:19:13,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 397 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:13,279 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 213 flow [2022-12-06 06:19:13,279 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-06 06:19:13,280 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:19:13,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:13,280 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 213 flow [2022-12-06 06:19:13,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:13,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:13,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 213 flow [2022-12-06 06:19:13,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 213 flow [2022-12-06 06:19:13,293 INFO L130 PetriNetUnfolder]: 34/113 cut-off events. [2022-12-06 06:19:13,293 INFO L131 PetriNetUnfolder]: For 292/298 co-relation queries the response was YES. [2022-12-06 06:19:13,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 113 events. 34/113 cut-off events. For 292/298 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 489 event pairs, 2 based on Foata normal form. 5/115 useless extension candidates. Maximal degree in co-relation 331. Up to 30 conditions per place. [2022-12-06 06:19:13,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 213 flow [2022-12-06 06:19:13,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 06:19:13,295 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:13,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:19:13,295 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 213 flow [2022-12-06 06:19:13,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:13,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:13,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:19:13,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1263949011, now seen corresponding path program 1 times [2022-12-06 06:19:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:13,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284519444] [2022-12-06 06:19:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:13,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284519444] [2022-12-06 06:19:13,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284519444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:13,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:13,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289104831] [2022-12-06 06:19:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:13,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:13,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:13,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:13,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:19:13,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:13,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:19:13,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:13,531 INFO L130 PetriNetUnfolder]: 137/304 cut-off events. [2022-12-06 06:19:13,531 INFO L131 PetriNetUnfolder]: For 781/781 co-relation queries the response was YES. [2022-12-06 06:19:13,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 304 events. 137/304 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1395 event pairs, 38 based on Foata normal form. 6/309 useless extension candidates. Maximal degree in co-relation 1118. Up to 120 conditions per place. [2022-12-06 06:19:13,533 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 21 selfloop transitions, 1 changer transitions 26/49 dead transitions. [2022-12-06 06:19:13,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 397 flow [2022-12-06 06:19:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 06:19:13,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-06 06:19:13,534 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 213 flow. Second operand 4 states and 38 transitions. [2022-12-06 06:19:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 397 flow [2022-12-06 06:19:13,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 376 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:13,536 INFO L231 Difference]: Finished difference. Result has 44 places, 23 transitions, 141 flow [2022-12-06 06:19:13,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=44, PETRI_TRANSITIONS=23} [2022-12-06 06:19:13,536 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 06:19:13,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:13,536 INFO L89 Accepts]: Start accepts. Operand has 44 places, 23 transitions, 141 flow [2022-12-06 06:19:13,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:13,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:13,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 23 transitions, 141 flow [2022-12-06 06:19:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 141 flow [2022-12-06 06:19:13,543 INFO L130 PetriNetUnfolder]: 10/44 cut-off events. [2022-12-06 06:19:13,543 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-06 06:19:13,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 44 events. 10/44 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 1 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 119. Up to 12 conditions per place. [2022-12-06 06:19:13,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 141 flow [2022-12-06 06:19:13,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 06:19:13,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] $Ultimate##0-->L789: Formula: (and (= v_~x$r_buff0_thd3~0_113 v_~x$r_buff1_thd3~0_109) (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$r_buff0_thd0~0_152 v_~x$r_buff1_thd0~0_145) (= v_~x$r_buff0_thd2~0_142 1) (= v_~x$r_buff0_thd2~0_143 v_~x$r_buff1_thd2~0_111) (= v_~x$r_buff0_thd1~0_191 v_~x$r_buff1_thd1~0_194) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_391 256) 0)) (not (= (mod v_~x$w_buff0_used~0_434 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0_used~0_434 1) (= v_~x$w_buff0_used~0_435 v_~x$w_buff1_used~0_391) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (= v_~x$w_buff0~0_283 v_~x$w_buff1~0_251) (= v_~x$w_buff0~0_282 1) (= v_~y~0_64 v_~__unbuffered_p1_EAX~0_104)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_283, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_152, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~y~0=v_~y~0_64, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_282, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_152, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_191, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~x$w_buff1~0=v_~x$w_buff1~0_251, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_109, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_391, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_194, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_145, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_434, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] and [459] $Ultimate##0-->L819: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd3~0_112 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_116 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_438 256) 0)))) (let ((.cse2 (and .cse5 .cse1)) (.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_439 256) 0)))) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_394 256) 0))))) (and (= v_~y~0_68 v_~__unbuffered_p2_EAX~0_104) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_393 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_115 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_112) v_~x$r_buff1_thd3~0_111) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_116) v_~x$r_buff0_thd3~0_115) (= v_~__unbuffered_p2_EBX~0_103 v_~z~0_61) (= v_~x$w_buff0_used~0_438 (ite .cse3 0 v_~x$w_buff0_used~0_439)) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= (ite (or .cse2 .cse4) 0 v_~x$w_buff1_used~0_394) v_~x$w_buff1_used~0_393) (= v_~y~0_68 1) (= (ite .cse3 v_~x$w_buff0~0_286 (ite .cse4 v_~x$w_buff1~0_253 v_~x~0_348)) v_~x~0_347) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_286, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_253, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_394, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_116, ~z~0=v_~z~0_61, ~x~0=v_~x~0_348, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_439} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_286, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~x$w_buff1~0=v_~x$w_buff1~0_253, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_393, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_61, ~y~0=v_~y~0_68, ~x~0=v_~x~0_347} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:19:13,892 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:13,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-06 06:19:13,892 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 151 flow [2022-12-06 06:19:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:13,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:19:13,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952551, now seen corresponding path program 1 times [2022-12-06 06:19:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413944191] [2022-12-06 06:19:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:13,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:19:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:13,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:19:13,989 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:19:13,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:19:13,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:19:13,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:19:13,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:19:13,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:19:13,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:19:13,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:19:13,992 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:13,998 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:19:13,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:19:14,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:19:14 BasicIcfg [2022-12-06 06:19:14,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:19:14,034 INFO L158 Benchmark]: Toolchain (without parser) took 12764.94ms. Allocated memory was 181.4MB in the beginning and 421.5MB in the end (delta: 240.1MB). Free memory was 155.6MB in the beginning and 380.3MB in the end (delta: -224.7MB). Peak memory consumption was 251.4MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,034 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:19:14,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.99ms. Allocated memory is still 181.4MB. Free memory was 155.6MB in the beginning and 129.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.36ms. Allocated memory is still 181.4MB. Free memory was 129.4MB in the beginning and 126.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,034 INFO L158 Benchmark]: Boogie Preprocessor took 53.25ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,035 INFO L158 Benchmark]: RCFGBuilder took 678.55ms. Allocated memory is still 181.4MB. Free memory was 124.7MB in the beginning and 92.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,035 INFO L158 Benchmark]: TraceAbstraction took 11519.52ms. Allocated memory was 181.4MB in the beginning and 421.5MB in the end (delta: 240.1MB). Free memory was 92.2MB in the beginning and 380.3MB in the end (delta: -288.1MB). Peak memory consumption was 188.5MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,036 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.99ms. Allocated memory is still 181.4MB. Free memory was 155.6MB in the beginning and 129.4MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.36ms. Allocated memory is still 181.4MB. Free memory was 129.4MB in the beginning and 126.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.25ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 124.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 678.55ms. Allocated memory is still 181.4MB. Free memory was 124.7MB in the beginning and 92.7MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11519.52ms. Allocated memory was 181.4MB in the beginning and 421.5MB in the end (delta: 240.1MB). Free memory was 92.2MB in the beginning and 380.3MB in the end (delta: -288.1MB). Peak memory consumption was 188.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 115 PlacesBefore, 36 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1449, independent: 1394, independent conditional: 1394, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1449, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1449, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1449, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1180, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1180, independent: 1130, independent conditional: 0, independent unconditional: 1130, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1449, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1180, unknown conditional: 0, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 1805, Positive cache size: 1767, Positive conditional cache size: 0, Positive unconditional cache size: 1767, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 71, independent conditional: 5, independent unconditional: 66, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78, independent: 62, independent conditional: 5, independent unconditional: 57, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 78, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 63, dependent conditional: 16, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 78, unknown conditional: 7, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 62, Positive conditional cache size: 5, Positive unconditional cache size: 57, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 149, independent conditional: 9, independent unconditional: 140, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 96, Positive conditional cache size: 5, Positive unconditional cache size: 91, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 4, independent unconditional: 37, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 41, independent conditional: 3, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 41, independent conditional: 3, independent unconditional: 38, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 41, independent conditional: 3, independent unconditional: 38, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 96, Positive conditional cache size: 5, Positive unconditional cache size: 91, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 48, independent conditional: 15, independent unconditional: 33, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 48, independent conditional: 7, independent unconditional: 41, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 48, independent conditional: 7, independent unconditional: 41, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 98, Positive conditional cache size: 5, Positive unconditional cache size: 93, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 98, Positive conditional cache size: 5, Positive unconditional cache size: 93, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 46 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 56, independent conditional: 38, independent unconditional: 18, dependent: 39, dependent conditional: 15, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 56, independent conditional: 7, independent unconditional: 49, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 56, independent conditional: 7, independent unconditional: 49, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 51, independent conditional: 7, independent unconditional: 44, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 135, Positive conditional cache size: 5, Positive unconditional cache size: 130, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 44 PlacesBefore, 41 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 23, independent conditional: 20, independent unconditional: 3, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 164, Positive conditional cache size: 9, Positive unconditional cache size: 155, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 13, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 12, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 180, Positive conditional cache size: 11, Positive unconditional cache size: 169, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 180, Positive conditional cache size: 11, Positive unconditional cache size: 169, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 91, independent: 77, independent conditional: 48, independent unconditional: 29, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 77, independent conditional: 46, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 77, independent conditional: 46, independent unconditional: 31, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 67, independent conditional: 39, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 196, Positive conditional cache size: 19, Positive unconditional cache size: 177, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t412; [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-2, t412={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t413; [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-1, t412={5:0}, t413={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t414; [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t414, ((void *)0), P2, ((void *)0))=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 __unbuffered_p1_EAX = y [L805] 2 y = 1 [L808] 2 __unbuffered_p2_EAX = y [L811] 2 __unbuffered_p2_EBX = z [L814] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L815] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L817] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L843] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L845] RET 2 assume_abort_if_not(main$tmp_guard0) [L847] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L856] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 720 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 8 mSDtfsCounter, 720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:19:14,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...