/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:33:12,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:33:12,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:33:12,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:33:12,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:33:12,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:33:12,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:33:12,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:33:12,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:33:12,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:33:12,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:33:12,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:33:12,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:33:12,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:33:12,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:33:12,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:33:12,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:33:12,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:33:12,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:33:12,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:33:12,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:33:12,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:33:12,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:33:12,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:33:12,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:33:12,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:33:12,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:33:12,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:33:12,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:33:12,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:33:12,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:33:12,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:33:12,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:33:12,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:33:12,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:33:12,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:33:12,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:33:12,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:33:12,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:33:12,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:33:12,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:33:12,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:33:12,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:33:12,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:33:12,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:33:12,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:33:12,236 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:33:12,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:33:12,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:33:12,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:33:12,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:33:12,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:33:12,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:33:12,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:33:12,238 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:33:12,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:33:12,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:33:12,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:33:12,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:33:12,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:33:12,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:33:12,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:33:12,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:33:12,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:33:12,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:33:12,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:33:12,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:33:12,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:33:12,597 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:33:12,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-12-13 00:33:13,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:33:14,018 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:33:14,018 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-12-13 00:33:14,046 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9fdcb310/7cfd2de543ca40838e17f466efa155a8/FLAGc9f417499 [2022-12-13 00:33:14,061 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9fdcb310/7cfd2de543ca40838e17f466efa155a8 [2022-12-13 00:33:14,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:33:14,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:33:14,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:33:14,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:33:14,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:33:14,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cc2f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14, skipping insertion in model container [2022-12-13 00:33:14,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:33:14,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:33:14,315 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/mix003.oepc.i[945,958] [2022-12-13 00:33:14,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:33:14,540 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:33:14,552 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/mix003.oepc.i[945,958] [2022-12-13 00:33:14,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:33:14,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:33:14,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:33:14,639 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:33:14,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14 WrapperNode [2022-12-13 00:33:14,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:33:14,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:33:14,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:33:14,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:33:14,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,711 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-13 00:33:14,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:33:14,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:33:14,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:33:14,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:33:14,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,734 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:33:14,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:33:14,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:33:14,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:33:14,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (1/1) ... [2022-12-13 00:33:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:33:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:33:14,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:33:14,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:33:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:33:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:33:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:33:14,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:33:14,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:33:14,811 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:33:14,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:33:14,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:33:14,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:33:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:33:14,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:33:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:33:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:33:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:33:14,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:33:14,813 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:33:15,005 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:33:15,007 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:33:15,336 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:33:15,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:33:15,462 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:33:15,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:15 BoogieIcfgContainer [2022-12-13 00:33:15,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:33:15,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:33:15,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:33:15,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:33:15,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:33:14" (1/3) ... [2022-12-13 00:33:15,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e24a74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:15, skipping insertion in model container [2022-12-13 00:33:15,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:33:14" (2/3) ... [2022-12-13 00:33:15,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e24a74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:33:15, skipping insertion in model container [2022-12-13 00:33:15,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:33:15" (3/3) ... [2022-12-13 00:33:15,475 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2022-12-13 00:33:15,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:33:15,493 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:33:15,493 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:33:15,552 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:33:15,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 00:33:15,676 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 00:33:15,676 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:15,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:33:15,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 00:33:15,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 00:33:15,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:15,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 00:33:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 00:33:15,754 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 00:33:15,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:33:15,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 00:33:15,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 2112 [2022-12-13 00:33:21,335 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 00:33:21,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:33:21,354 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;@466dfa13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:33:21,354 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:33:21,357 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-13 00:33:21,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:21,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:21,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:33:21,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 502641, now seen corresponding path program 1 times [2022-12-13 00:33:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:21,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807351623] [2022-12-13 00:33:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:21,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:21,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:21,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807351623] [2022-12-13 00:33:21,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807351623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:21,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:21,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:33:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705099811] [2022-12-13 00:33:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:21,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:33:21,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:33:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:33:21,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 68 [2022-12-13 00:33:21,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:21,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:21,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 68 [2022-12-13 00:33:21,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:23,490 INFO L130 PetriNetUnfolder]: 9240/14305 cut-off events. [2022-12-13 00:33:23,491 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:33:23,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27543 conditions, 14305 events. 9240/14305 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 99461 event pairs, 4424 based on Foata normal form. 0/8830 useless extension candidates. Maximal degree in co-relation 27532. Up to 11165 conditions per place. [2022-12-13 00:33:23,542 INFO L137 encePairwiseOnDemand]: 63/68 looper letters, 36 selfloop transitions, 2 changer transitions 59/110 dead transitions. [2022-12-13 00:33:23,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 427 flow [2022-12-13 00:33:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:23,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-12-13 00:33:23,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2022-12-13 00:33:23,554 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 145 flow. Second operand 3 states and 143 transitions. [2022-12-13 00:33:23,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 427 flow [2022-12-13 00:33:23,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 422 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:33:23,559 INFO L231 Difference]: Finished difference. Result has 74 places, 35 transitions, 80 flow [2022-12-13 00:33:23,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=74, PETRI_TRANSITIONS=35} [2022-12-13 00:33:23,564 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2022-12-13 00:33:23,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:23,565 INFO L89 Accepts]: Start accepts. Operand has 74 places, 35 transitions, 80 flow [2022-12-13 00:33:23,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:23,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:23,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 35 transitions, 80 flow [2022-12-13 00:33:23,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2022-12-13 00:33:23,574 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 00:33:23,574 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:23,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 88 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:33:23,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2022-12-13 00:33:23,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 700 [2022-12-13 00:33:23,784 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:23,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-13 00:33:23,786 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2022-12-13 00:33:23,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:23,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:23,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:33:23,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash 781085143, now seen corresponding path program 1 times [2022-12-13 00:33:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:23,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786608695] [2022-12-13 00:33:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:23,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:23,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786608695] [2022-12-13 00:33:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786608695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:33:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768086705] [2022-12-13 00:33:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:33:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:33:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:33:23,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:33:23,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:23,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:23,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:33:23,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:24,470 INFO L130 PetriNetUnfolder]: 3580/5402 cut-off events. [2022-12-13 00:33:24,470 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-13 00:33:24,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 5402 events. 3580/5402 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27959 event pairs, 1730 based on Foata normal form. 0/4423 useless extension candidates. Maximal degree in co-relation 10890. Up to 5044 conditions per place. [2022-12-13 00:33:24,501 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 34 selfloop transitions, 4 changer transitions 2/48 dead transitions. [2022-12-13 00:33:24,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 192 flow [2022-12-13 00:33:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:33:24,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-13 00:33:24,502 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:33:24,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 192 flow [2022-12-13 00:33:24,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:24,504 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 100 flow [2022-12-13 00:33:24,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 00:33:24,505 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -32 predicate places. [2022-12-13 00:33:24,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:24,505 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 100 flow [2022-12-13 00:33:24,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:24,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:24,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 100 flow [2022-12-13 00:33:24,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 100 flow [2022-12-13 00:33:24,516 INFO L130 PetriNetUnfolder]: 14/98 cut-off events. [2022-12-13 00:33:24,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:33:24,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 98 events. 14/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 405 event pairs, 6 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 131. Up to 29 conditions per place. [2022-12-13 00:33:24,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 100 flow [2022-12-13 00:33:24,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-13 00:33:24,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:24,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 00:33:24,553 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 100 flow [2022-12-13 00:33:24,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:24,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:24,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:33:24,553 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:24,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2005374920, now seen corresponding path program 1 times [2022-12-13 00:33:24,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:24,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958148176] [2022-12-13 00:33:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:24,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958148176] [2022-12-13 00:33:24,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958148176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:24,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:24,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776430182] [2022-12-13 00:33:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:24,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:24,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:24,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:33:24,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:24,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:24,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:33:24,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:25,069 INFO L130 PetriNetUnfolder]: 2629/4029 cut-off events. [2022-12-13 00:33:25,070 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2022-12-13 00:33:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8698 conditions, 4029 events. 2629/4029 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 20637 event pairs, 819 based on Foata normal form. 76/3571 useless extension candidates. Maximal degree in co-relation 8687. Up to 3019 conditions per place. [2022-12-13 00:33:25,126 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 41 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 00:33:25,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 224 flow [2022-12-13 00:33:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 00:33:25,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-13 00:33:25,128 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 100 flow. Second operand 3 states and 66 transitions. [2022-12-13 00:33:25,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 224 flow [2022-12-13 00:33:25,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:33:25,130 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 00:33:25,130 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -31 predicate places. [2022-12-13 00:33:25,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:25,131 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:25,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:25,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,140 INFO L130 PetriNetUnfolder]: 9/75 cut-off events. [2022-12-13 00:33:25,141 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-13 00:33:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 75 events. 9/75 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 278 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 109. Up to 21 conditions per place. [2022-12-13 00:33:25,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 00:33:25,144 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:25,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 00:33:25,145 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 107 flow [2022-12-13 00:33:25,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:25,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:25,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:33:25,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1741992626, now seen corresponding path program 1 times [2022-12-13 00:33:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:25,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684414853] [2022-12-13 00:33:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:25,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684414853] [2022-12-13 00:33:25,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684414853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:25,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:25,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:33:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241872000] [2022-12-13 00:33:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:25,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:25,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:25,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:25,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:25,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:33:25,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:25,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:33:25,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:25,722 INFO L130 PetriNetUnfolder]: 2471/3793 cut-off events. [2022-12-13 00:33:25,722 INFO L131 PetriNetUnfolder]: For 1094/1094 co-relation queries the response was YES. [2022-12-13 00:33:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 3793 events. 2471/3793 cut-off events. For 1094/1094 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18440 event pairs, 701 based on Foata normal form. 60/3341 useless extension candidates. Maximal degree in co-relation 8513. Up to 2631 conditions per place. [2022-12-13 00:33:25,747 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 00:33:25,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 224 flow [2022-12-13 00:33:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:33:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:33:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:33:25,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-13 00:33:25,749 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 107 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:33:25,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 224 flow [2022-12-13 00:33:25,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:25,751 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-13 00:33:25,752 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -30 predicate places. [2022-12-13 00:33:25,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:25,752 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:25,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:25,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,760 INFO L130 PetriNetUnfolder]: 6/65 cut-off events. [2022-12-13 00:33:25,760 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 00:33:25,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 65 events. 6/65 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 229 event pairs, 1 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 98. Up to 16 conditions per place. [2022-12-13 00:33:25,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 688 [2022-12-13 00:33:25,777 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:33:25,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 00:33:25,778 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 112 flow [2022-12-13 00:33:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:25,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:33:25,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1235541645, now seen corresponding path program 1 times [2022-12-13 00:33:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483200619] [2022-12-13 00:33:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:25,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483200619] [2022-12-13 00:33:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483200619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:25,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:25,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:33:25,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265752333] [2022-12-13 00:33:25,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:25,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:25,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:33:25,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:25,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:25,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:33:25,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:26,376 INFO L130 PetriNetUnfolder]: 2502/4014 cut-off events. [2022-12-13 00:33:26,377 INFO L131 PetriNetUnfolder]: For 940/982 co-relation queries the response was YES. [2022-12-13 00:33:26,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 4014 events. 2502/4014 cut-off events. For 940/982 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23455 event pairs, 595 based on Foata normal form. 320/3105 useless extension candidates. Maximal degree in co-relation 8681. Up to 2977 conditions per place. [2022-12-13 00:33:26,410 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 58 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2022-12-13 00:33:26,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 90 transitions, 378 flow [2022-12-13 00:33:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:33:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:33:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-12-13 00:33:26,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2022-12-13 00:33:26,412 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 112 flow. Second operand 5 states and 125 transitions. [2022-12-13 00:33:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 90 transitions, 378 flow [2022-12-13 00:33:26,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 90 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:26,415 INFO L231 Difference]: Finished difference. Result has 52 places, 56 transitions, 256 flow [2022-12-13 00:33:26,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=52, PETRI_TRANSITIONS=56} [2022-12-13 00:33:26,415 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -25 predicate places. [2022-12-13 00:33:26,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:26,416 INFO L89 Accepts]: Start accepts. Operand has 52 places, 56 transitions, 256 flow [2022-12-13 00:33:26,416 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:26,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:26,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 56 transitions, 256 flow [2022-12-13 00:33:26,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 56 transitions, 256 flow [2022-12-13 00:33:26,477 INFO L130 PetriNetUnfolder]: 560/1045 cut-off events. [2022-12-13 00:33:26,477 INFO L131 PetriNetUnfolder]: For 515/665 co-relation queries the response was YES. [2022-12-13 00:33:26,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 1045 events. 560/1045 cut-off events. For 515/665 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 7224 event pairs, 253 based on Foata normal form. 2/523 useless extension candidates. Maximal degree in co-relation 3049. Up to 800 conditions per place. [2022-12-13 00:33:26,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 56 transitions, 256 flow [2022-12-13 00:33:26,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 1010 [2022-12-13 00:33:26,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [479] L828-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_221 (+ v_~__unbuffered_cnt~0_222 1)) (= |v_P2Thread1of1ForFork0_#res.offset_23| 0) (= |v_P2Thread1of1ForFork0_#res.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_222} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_221, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:33:26,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [338] L769-->L772: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:33:26,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [346] L792-->L795: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:33:26,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [376] L828-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 00:33:26,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [462] L769-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_209 (+ v_~__unbuffered_cnt~0_210 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_21| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_21| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_210} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_21|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_209} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 00:33:26,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [388] L792-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_65 (+ v_~__unbuffered_cnt~0_66 1)) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:33:26,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [423] L792-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_17|) (= |v_P1Thread1of1ForFork2_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 00:33:26,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [354] L828-->L831: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:33:26,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [420] L850-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| (mod v_~main$tmp_guard0~0_26 256)) (= v_~main$tmp_guard0~0_26 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [395] L769-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res#1.base_5| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_5|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 00:33:26,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:33:26,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-13 00:33:26,802 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 286 flow [2022-12-13 00:33:26,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:26,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:26,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:26,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:33:26,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1990398622, now seen corresponding path program 1 times [2022-12-13 00:33:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:26,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225130819] [2022-12-13 00:33:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:26,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225130819] [2022-12-13 00:33:26,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225130819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:26,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:26,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:33:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258679931] [2022-12-13 00:33:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:26,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:33:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:33:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:33:26,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-13 00:33:26,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:26,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:26,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-13 00:33:26,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:27,419 INFO L130 PetriNetUnfolder]: 1781/3165 cut-off events. [2022-12-13 00:33:27,419 INFO L131 PetriNetUnfolder]: For 1507/1516 co-relation queries the response was YES. [2022-12-13 00:33:27,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10536 conditions, 3165 events. 1781/3165 cut-off events. For 1507/1516 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 20152 event pairs, 163 based on Foata normal form. 270/2409 useless extension candidates. Maximal degree in co-relation 10519. Up to 1759 conditions per place. [2022-12-13 00:33:27,445 INFO L137 encePairwiseOnDemand]: 22/43 looper letters, 53 selfloop transitions, 38 changer transitions 14/117 dead transitions. [2022-12-13 00:33:27,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 736 flow [2022-12-13 00:33:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:33:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:33:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2022-12-13 00:33:27,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.624031007751938 [2022-12-13 00:33:27,448 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 286 flow. Second operand 6 states and 161 transitions. [2022-12-13 00:33:27,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 736 flow [2022-12-13 00:33:27,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 708 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 00:33:27,461 INFO L231 Difference]: Finished difference. Result has 58 places, 74 transitions, 517 flow [2022-12-13 00:33:27,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=517, PETRI_PLACES=58, PETRI_TRANSITIONS=74} [2022-12-13 00:33:27,464 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -19 predicate places. [2022-12-13 00:33:27,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:27,464 INFO L89 Accepts]: Start accepts. Operand has 58 places, 74 transitions, 517 flow [2022-12-13 00:33:27,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:27,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:27,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 74 transitions, 517 flow [2022-12-13 00:33:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 74 transitions, 517 flow [2022-12-13 00:33:27,529 INFO L130 PetriNetUnfolder]: 365/831 cut-off events. [2022-12-13 00:33:27,529 INFO L131 PetriNetUnfolder]: For 1627/2005 co-relation queries the response was YES. [2022-12-13 00:33:27,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 831 events. 365/831 cut-off events. For 1627/2005 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 6038 event pairs, 55 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 3481. Up to 649 conditions per place. [2022-12-13 00:33:27,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 74 transitions, 517 flow [2022-12-13 00:33:27,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 1190 [2022-12-13 00:33:27,831 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:33:27,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 00:33:27,832 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 73 transitions, 509 flow [2022-12-13 00:33:27,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:27,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:27,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:33:27,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1379167078, now seen corresponding path program 1 times [2022-12-13 00:33:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601126224] [2022-12-13 00:33:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:28,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:28,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601126224] [2022-12-13 00:33:28,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601126224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:28,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:28,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:33:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239798170] [2022-12-13 00:33:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:28,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:33:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:33:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:33:28,038 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2022-12-13 00:33:28,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 73 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:28,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:28,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2022-12-13 00:33:28,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:28,405 INFO L130 PetriNetUnfolder]: 1034/1959 cut-off events. [2022-12-13 00:33:28,406 INFO L131 PetriNetUnfolder]: For 2321/2321 co-relation queries the response was YES. [2022-12-13 00:33:28,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7741 conditions, 1959 events. 1034/1959 cut-off events. For 2321/2321 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12066 event pairs, 82 based on Foata normal form. 135/1431 useless extension candidates. Maximal degree in co-relation 7720. Up to 1084 conditions per place. [2022-12-13 00:33:28,419 INFO L137 encePairwiseOnDemand]: 22/43 looper letters, 44 selfloop transitions, 47 changer transitions 14/117 dead transitions. [2022-12-13 00:33:28,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 117 transitions, 871 flow [2022-12-13 00:33:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:33:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:33:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2022-12-13 00:33:28,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5203488372093024 [2022-12-13 00:33:28,421 INFO L175 Difference]: Start difference. First operand has 58 places, 73 transitions, 509 flow. Second operand 8 states and 179 transitions. [2022-12-13 00:33:28,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 117 transitions, 871 flow [2022-12-13 00:33:28,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 737 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-13 00:33:28,512 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 510 flow [2022-12-13 00:33:28,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2022-12-13 00:33:28,513 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -14 predicate places. [2022-12-13 00:33:28,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:28,513 INFO L89 Accepts]: Start accepts. Operand has 63 places, 74 transitions, 510 flow [2022-12-13 00:33:28,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:28,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:28,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 74 transitions, 510 flow [2022-12-13 00:33:28,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 74 transitions, 510 flow [2022-12-13 00:33:28,549 INFO L130 PetriNetUnfolder]: 149/468 cut-off events. [2022-12-13 00:33:28,550 INFO L131 PetriNetUnfolder]: For 582/672 co-relation queries the response was YES. [2022-12-13 00:33:28,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 468 events. 149/468 cut-off events. For 582/672 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3257 event pairs, 1 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 1874. Up to 196 conditions per place. [2022-12-13 00:33:28,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 74 transitions, 510 flow [2022-12-13 00:33:28,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-13 00:33:29,005 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:33:29,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 493 [2022-12-13 00:33:29,006 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 397 flow [2022-12-13 00:33:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:29,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:29,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:33:29,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1294134205, now seen corresponding path program 1 times [2022-12-13 00:33:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462975116] [2022-12-13 00:33:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:29,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462975116] [2022-12-13 00:33:29,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462975116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:29,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:29,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:33:29,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650591413] [2022-12-13 00:33:29,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:33:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:29,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:33:29,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:33:29,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:33:29,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 397 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:29,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:29,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:33:29,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:29,516 INFO L130 PetriNetUnfolder]: 1054/1847 cut-off events. [2022-12-13 00:33:29,516 INFO L131 PetriNetUnfolder]: For 3254/3427 co-relation queries the response was YES. [2022-12-13 00:33:29,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 1847 events. 1054/1847 cut-off events. For 3254/3427 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9838 event pairs, 52 based on Foata normal form. 139/1651 useless extension candidates. Maximal degree in co-relation 6991. Up to 773 conditions per place. [2022-12-13 00:33:29,526 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 52 selfloop transitions, 4 changer transitions 34/104 dead transitions. [2022-12-13 00:33:29,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 806 flow [2022-12-13 00:33:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:33:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:33:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 00:33:29,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.578125 [2022-12-13 00:33:29,528 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 397 flow. Second operand 6 states and 111 transitions. [2022-12-13 00:33:29,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 806 flow [2022-12-13 00:33:29,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 614 flow, removed 49 selfloop flow, removed 8 redundant places. [2022-12-13 00:33:29,557 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 233 flow [2022-12-13 00:33:29,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-13 00:33:29,557 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -23 predicate places. [2022-12-13 00:33:29,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:29,558 INFO L89 Accepts]: Start accepts. Operand has 54 places, 52 transitions, 233 flow [2022-12-13 00:33:29,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:29,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:29,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 233 flow [2022-12-13 00:33:29,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 233 flow [2022-12-13 00:33:29,578 INFO L130 PetriNetUnfolder]: 103/261 cut-off events. [2022-12-13 00:33:29,578 INFO L131 PetriNetUnfolder]: For 205/214 co-relation queries the response was YES. [2022-12-13 00:33:29,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 261 events. 103/261 cut-off events. For 205/214 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1265 event pairs, 1 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 694. Up to 118 conditions per place. [2022-12-13 00:33:29,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 52 transitions, 233 flow [2022-12-13 00:33:29,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 00:33:29,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:33:29,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 00:33:29,605 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 231 flow [2022-12-13 00:33:29,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:29,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:29,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:29,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:33:29,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 960822663, now seen corresponding path program 1 times [2022-12-13 00:33:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:29,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383398436] [2022-12-13 00:33:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383398436] [2022-12-13 00:33:29,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383398436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:29,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:29,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:33:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894149664] [2022-12-13 00:33:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:29,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:33:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:33:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:33:29,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 00:33:29,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:29,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:29,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 00:33:29,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:30,024 INFO L130 PetriNetUnfolder]: 919/1682 cut-off events. [2022-12-13 00:33:30,024 INFO L131 PetriNetUnfolder]: For 1554/1674 co-relation queries the response was YES. [2022-12-13 00:33:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5248 conditions, 1682 events. 919/1682 cut-off events. For 1554/1674 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9822 event pairs, 124 based on Foata normal form. 124/1467 useless extension candidates. Maximal degree in co-relation 5230. Up to 768 conditions per place. [2022-12-13 00:33:30,035 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 38 selfloop transitions, 1 changer transitions 40/93 dead transitions. [2022-12-13 00:33:30,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 93 transitions, 583 flow [2022-12-13 00:33:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:33:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:33:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 00:33:30,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6854838709677419 [2022-12-13 00:33:30,038 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 231 flow. Second operand 4 states and 85 transitions. [2022-12-13 00:33:30,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 93 transitions, 583 flow [2022-12-13 00:33:30,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 577 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:33:30,057 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 222 flow [2022-12-13 00:33:30,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2022-12-13 00:33:30,058 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -23 predicate places. [2022-12-13 00:33:30,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:30,058 INFO L89 Accepts]: Start accepts. Operand has 54 places, 48 transitions, 222 flow [2022-12-13 00:33:30,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:30,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:30,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 222 flow [2022-12-13 00:33:30,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 222 flow [2022-12-13 00:33:30,077 INFO L130 PetriNetUnfolder]: 91/218 cut-off events. [2022-12-13 00:33:30,077 INFO L131 PetriNetUnfolder]: For 202/211 co-relation queries the response was YES. [2022-12-13 00:33:30,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 218 events. 91/218 cut-off events. For 202/211 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 986 event pairs, 1 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 591. Up to 109 conditions per place. [2022-12-13 00:33:30,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 222 flow [2022-12-13 00:33:30,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 00:33:30,663 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:33:30,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 606 [2022-12-13 00:33:30,664 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 214 flow [2022-12-13 00:33:30,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:30,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:30,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:30,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:33:30,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1199290785, now seen corresponding path program 1 times [2022-12-13 00:33:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:30,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326271747] [2022-12-13 00:33:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:33:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:33:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:33:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326271747] [2022-12-13 00:33:31,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326271747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:33:31,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:33:31,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:33:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264764223] [2022-12-13 00:33:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:33:31,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:33:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:33:31,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:33:31,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:33:31,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 26 [2022-12-13 00:33:31,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:31,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:33:31,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 26 [2022-12-13 00:33:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:33:31,591 INFO L130 PetriNetUnfolder]: 424/810 cut-off events. [2022-12-13 00:33:31,591 INFO L131 PetriNetUnfolder]: For 1037/1081 co-relation queries the response was YES. [2022-12-13 00:33:31,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 810 events. 424/810 cut-off events. For 1037/1081 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4416 event pairs, 10 based on Foata normal form. 58/668 useless extension candidates. Maximal degree in co-relation 2651. Up to 344 conditions per place. [2022-12-13 00:33:31,596 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 41 selfloop transitions, 4 changer transitions 28/84 dead transitions. [2022-12-13 00:33:31,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 548 flow [2022-12-13 00:33:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:33:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:33:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-12-13 00:33:31,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-13 00:33:31,597 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 214 flow. Second operand 6 states and 86 transitions. [2022-12-13 00:33:31,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 548 flow [2022-12-13 00:33:31,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 540 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 00:33:31,605 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 215 flow [2022-12-13 00:33:31,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 00:33:31,605 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -26 predicate places. [2022-12-13 00:33:31,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:33:31,606 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 215 flow [2022-12-13 00:33:31,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:33:31,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:33:31,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 215 flow [2022-12-13 00:33:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 215 flow [2022-12-13 00:33:31,625 INFO L130 PetriNetUnfolder]: 99/234 cut-off events. [2022-12-13 00:33:31,625 INFO L131 PetriNetUnfolder]: For 218/226 co-relation queries the response was YES. [2022-12-13 00:33:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 234 events. 99/234 cut-off events. For 218/226 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1117 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 683. Up to 118 conditions per place. [2022-12-13 00:33:31,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 215 flow [2022-12-13 00:33:31,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 00:33:31,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] L850-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_416 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_151 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_146 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_417 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_372 256) 0)) .cse3)) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff0_used~0_416 (ite .cse0 0 v_~z$w_buff0_used~0_417)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115| (mod v_~main$tmp_guard0~0_126 256)) (= v_~z$r_buff0_thd0~0_145 (ite .cse1 0 v_~z$r_buff0_thd0~0_146)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|) (= v_~z~0_328 (ite .cse0 v_~z$w_buff0~0_257 (ite .cse2 v_~z$w_buff1~0_209 v_~z~0_329))) (= (mod v_~main$tmp_guard1~0_96 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_143|) (= v_~main$tmp_guard1~0_96 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_106 0) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~__unbuffered_p0_EAX~0_106 0) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p2_EBX~0_125 0))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_143| 0)) (= v_~z$r_buff1_thd0~0_150 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_371 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd0~0_145 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_151)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71| 0) (= v_~z$w_buff1_used~0_371 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_372)) (= v_~main$tmp_guard0~0_126 (ite (= (ite (= v_~__unbuffered_cnt~0_527 3) 1 0) 0) 0 1))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_106, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_125, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_417, ~z$w_buff0~0=v_~z$w_buff0~0_257, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ~z$w_buff1~0=v_~z$w_buff1~0_209, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_151, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_527, ~z~0=v_~z~0_329} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_106, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_125, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_121|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_416, ~z$w_buff0~0=v_~z$w_buff0~0_257, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_129|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_371, ~z$w_buff1~0=v_~z$w_buff1~0_209, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_126, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_145, 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_96, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_150, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_143|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_527, ~z~0=v_~z~0_328, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] $Ultimate##0-->L762: Formula: (and (= v_~z$w_buff0_used~0_420 1) (= v_~z$r_buff0_thd1~0_163 v_~z$r_buff1_thd1~0_114) (= v_~x~0_59 v_~__unbuffered_p0_EAX~0_108) (= v_~z$w_buff0~0_259 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_46| |v_P0Thread1of1ForFork1_#in~arg#1.offset_46|) (= v_~z$r_buff0_thd3~0_216 v_~z$r_buff1_thd3~0_213) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= v_~z$w_buff0~0_260 v_~z$w_buff1~0_211) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_375 256) 0)) (not (= (mod v_~z$w_buff0_used~0_420 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~z$r_buff0_thd2~0_135 v_~z$r_buff1_thd2~0_131) (= v_~z$r_buff0_thd0~0_149 v_~z$r_buff1_thd0~0_154) (= v_~z$w_buff0_used~0_421 v_~z$w_buff1_used~0_375) (= |v_P0Thread1of1ForFork1_~arg#1.base_46| |v_P0Thread1of1ForFork1_#in~arg#1.base_46|) (= v_~z$r_buff0_thd1~0_162 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_149, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_46|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_421, ~z$w_buff0~0=v_~z$w_buff0~0_260, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_216, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_46|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_163, ~x~0=v_~x~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_46|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_420, ~z$w_buff0~0=v_~z$w_buff0~0_259, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_213, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_375, ~z$w_buff1~0=v_~z$w_buff1~0_211, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_46|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_46|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_149, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_154, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_216, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_162, ~x~0=v_~x~0_59, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] [2022-12-13 00:33:32,847 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:33:32,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1242 [2022-12-13 00:33:32,848 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 252 flow [2022-12-13 00:33:32,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:33:32,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:33:32,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:32,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:33:32,848 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:33:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:33:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1725495692, now seen corresponding path program 1 times [2022-12-13 00:33:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:33:32,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802873530] [2022-12-13 00:33:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:33:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:33:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:33:32,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:33:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:33:32,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:33:32,961 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:33:32,962 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:33:32,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:33:32,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:33:32,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:33:32,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:33:32,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:33:32,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:33:32,967 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:33:32,974 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:33:32,974 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:33:33,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:33:33 BasicIcfg [2022-12-13 00:33:33,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:33:33,056 INFO L158 Benchmark]: Toolchain (without parser) took 18992.31ms. Allocated memory was 180.4MB in the beginning and 721.4MB in the end (delta: 541.1MB). Free memory was 139.1MB in the beginning and 415.6MB in the end (delta: -276.5MB). Peak memory consumption was 265.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,057 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:33:33,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.96ms. Allocated memory is still 180.4MB. Free memory was 139.1MB in the beginning and 112.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.17ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 109.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,057 INFO L158 Benchmark]: Boogie Preprocessor took 25.82ms. Allocated memory is still 180.4MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,057 INFO L158 Benchmark]: RCFGBuilder took 727.20ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 73.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,058 INFO L158 Benchmark]: TraceAbstraction took 17586.88ms. Allocated memory was 180.4MB in the beginning and 721.4MB in the end (delta: 541.1MB). Free memory was 72.5MB in the beginning and 415.6MB in the end (delta: -343.0MB). Peak memory consumption was 199.1MB. Max. memory is 8.0GB. [2022-12-13 00:33:33,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 567.96ms. Allocated memory is still 180.4MB. Free memory was 139.1MB in the beginning and 112.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.17ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 109.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.82ms. Allocated memory is still 180.4MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 727.20ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 73.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17586.88ms. Allocated memory was 180.4MB in the beginning and 721.4MB in the end (delta: 541.1MB). Free memory was 72.5MB in the beginning and 415.6MB in the end (delta: -343.0MB). Peak memory consumption was 199.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 118 PlacesBefore, 77 PlacesAfterwards, 110 TransitionsBefore, 68 TransitionsAfterwards, 2112 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3127, independent: 2993, independent conditional: 2993, independent unconditional: 0, dependent: 134, dependent conditional: 134, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3127, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3127, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3127, independent: 2993, independent conditional: 0, independent unconditional: 2993, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1789, independent: 1740, independent conditional: 0, independent unconditional: 1740, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1789, independent: 1716, independent conditional: 0, independent unconditional: 1716, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3127, independent: 1253, independent conditional: 0, independent unconditional: 1253, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 1789, unknown conditional: 0, unknown unconditional: 1789] , Statistics on independence cache: Total cache size (in pairs): 3289, Positive cache size: 3240, Positive conditional cache size: 0, Positive unconditional cache size: 3240, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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.2s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 337, independent conditional: 337, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 337, independent conditional: 30, independent unconditional: 307, dependent: 40, dependent conditional: 7, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 337, independent conditional: 30, independent unconditional: 307, dependent: 40, dependent conditional: 7, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 337, independent conditional: 30, independent unconditional: 307, dependent: 40, dependent conditional: 7, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 309, independent: 279, independent conditional: 27, independent unconditional: 252, dependent: 30, dependent conditional: 5, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 249, independent conditional: 0, independent unconditional: 249, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 30, dependent conditional: 5, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 201, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 173, dependent conditional: 73, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 377, independent: 58, independent conditional: 3, independent unconditional: 55, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 309, unknown conditional: 32, unknown unconditional: 277] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 279, Positive conditional cache size: 27, Positive unconditional cache size: 252, Negative cache size: 30, Negative conditional cache size: 5, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, independent: 270, independent conditional: 270, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 303, independent: 270, independent conditional: 8, independent unconditional: 262, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 316, Positive conditional cache size: 27, Positive unconditional cache size: 289, Negative cache size: 37, Negative conditional cache size: 5, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 283, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 283, independent: 250, independent conditional: 15, independent unconditional: 235, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 283, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 283, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 283, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 316, Positive conditional cache size: 27, Positive unconditional cache size: 289, Negative cache size: 37, Negative conditional cache size: 5, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 251, independent conditional: 251, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 251, independent conditional: 8, independent unconditional: 243, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 250, independent conditional: 0, independent unconditional: 250, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 317, Positive conditional cache size: 27, Positive unconditional cache size: 290, Negative cache size: 39, Negative conditional cache size: 5, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 51 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 1010 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 825, independent: 727, independent conditional: 727, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 825, independent: 727, independent conditional: 241, independent unconditional: 486, dependent: 98, dependent conditional: 4, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 825, independent: 727, independent conditional: 202, independent unconditional: 525, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 825, independent: 727, independent conditional: 202, independent unconditional: 525, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 825, independent: 713, independent conditional: 190, independent unconditional: 523, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 15, unknown conditional: 12, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 387, Positive conditional cache size: 45, Positive unconditional cache size: 342, Negative cache size: 40, Negative conditional cache size: 5, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 58 PlacesBefore, 58 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 1190 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 744, independent: 610, independent conditional: 610, independent unconditional: 0, dependent: 134, dependent conditional: 134, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 744, independent: 610, independent conditional: 346, independent unconditional: 264, dependent: 134, dependent conditional: 4, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 744, independent: 610, independent conditional: 338, independent unconditional: 272, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 744, independent: 610, independent conditional: 338, independent unconditional: 272, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 744, independent: 594, independent conditional: 324, independent unconditional: 270, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 18, unknown conditional: 14, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 403, Positive conditional cache size: 59, Positive unconditional cache size: 344, Negative cache size: 42, Negative conditional cache size: 5, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 62 PlacesBefore, 59 PlacesAfterwards, 74 TransitionsBefore, 62 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 759, independent: 655, independent conditional: 655, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 759, independent: 655, independent conditional: 128, independent unconditional: 527, dependent: 104, dependent conditional: 4, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 759, independent: 655, independent conditional: 116, independent unconditional: 539, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 759, independent: 655, independent conditional: 116, independent unconditional: 539, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 65, independent: 65, independent conditional: 65, 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: 65, independent: 65, independent conditional: 0, independent unconditional: 65, 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: 759, independent: 590, independent conditional: 51, independent unconditional: 539, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 65, unknown conditional: 65, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 470, Positive conditional cache size: 124, Positive unconditional cache size: 346, Negative cache size: 42, Negative conditional cache size: 5, Negative unconditional cache size: 37, 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.0s, 52 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 497, independent: 425, independent conditional: 425, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 497, independent: 425, independent conditional: 82, independent unconditional: 343, dependent: 72, dependent conditional: 4, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 501, independent: 425, independent conditional: 78, independent unconditional: 347, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 501, independent: 425, independent conditional: 78, independent unconditional: 347, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 501, independent: 411, independent conditional: 66, independent unconditional: 345, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 500, Positive conditional cache size: 138, Positive unconditional cache size: 362, Negative cache size: 42, Negative conditional cache size: 5, Negative unconditional cache size: 37, 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.6s, 52 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 44 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 786, independent: 692, independent conditional: 692, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 786, independent: 692, independent conditional: 318, independent unconditional: 374, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 786, independent: 692, independent conditional: 318, independent unconditional: 374, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 786, independent: 692, independent conditional: 318, independent unconditional: 374, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 31, independent unconditional: 16, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 786, independent: 645, independent conditional: 287, independent unconditional: 358, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 52, unknown conditional: 31, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 618, Positive conditional cache size: 181, Positive unconditional cache size: 437, Negative cache size: 47, Negative conditional cache size: 5, Negative unconditional cache size: 42, 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: 1.2s, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 325, independent conditional: 325, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 365, independent: 325, independent conditional: 245, independent unconditional: 80, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 325, independent conditional: 245, independent unconditional: 80, dependent: 50, dependent conditional: 10, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 325, independent conditional: 245, independent unconditional: 80, dependent: 50, dependent conditional: 10, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 17, independent unconditional: 4, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 53, dependent conditional: 29, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 375, independent: 304, independent conditional: 228, independent unconditional: 76, dependent: 46, dependent conditional: 8, dependent unconditional: 38, unknown: 25, unknown conditional: 19, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 864, Positive conditional cache size: 198, Positive unconditional cache size: 666, Negative cache size: 51, Negative conditional cache size: 7, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t62; [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t64, ((void *)0), P2, ((void *)0))=2, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __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=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 [L781] 2 __unbuffered_p1_EAX = x [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 [L804] 3 __unbuffered_p2_EAX = y [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 850]: 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: 848]: 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, 142 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: 17.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 358 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 19 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=6, InterpolantAutomatonStates: 47, 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, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 743 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-13 00:33:33,098 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...