/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:37:47,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:37:47,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:37:47,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:37:47,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:37:47,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:37:47,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:37:47,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:37:47,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:37:47,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:37:47,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:37:47,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:37:47,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:37:47,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:37:47,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:37:47,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:37:47,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:37:47,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:37:47,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:37:47,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:37:47,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:37:47,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:37:47,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:37:47,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:37:47,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:37:47,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:37:47,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:37:47,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:37:47,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:37:47,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:37:47,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:37:47,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:37:47,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:37:47,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:37:47,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:37:47,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:37:47,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:37:47,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:37:47,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:37:47,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:37:47,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:37:47,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:37:47,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:37:47,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:37:47,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:37:47,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:37:47,626 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:37:47,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:37:47,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:37:47,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:37:47,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:37:47,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:37:47,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:37:47,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:37:47,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:37:47,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:37:47,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:37:47,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:37:47,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:37:47,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:37:47,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:37:47,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:37:47,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:37:47,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:47,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:37:47,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:37:47,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:37:47,634 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:37:47,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:37:47,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:37:47,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:37:47,634 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 09:37:48,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:37:48,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:37:48,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:37:48,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:37:48,045 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:37:48,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:37:48,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:37:49,241 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:37:49,241 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:37:49,271 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715c29d5d/ee775cc341574936b2e9e06d9bc8c3a3/FLAGd81831477 [2022-12-13 09:37:49,283 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715c29d5d/ee775cc341574936b2e9e06d9bc8c3a3 [2022-12-13 09:37:49,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:37:49,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:37:49,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:49,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:37:49,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:37:49,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec9961f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49, skipping insertion in model container [2022-12-13 09:37:49,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:37:49,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:37:49,473 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 09:37:49,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:49,669 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:37:49,679 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 09:37:49,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:49,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:49,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:49,751 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:37:49,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49 WrapperNode [2022-12-13 09:37:49,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:49,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:49,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:37:49,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:37:49,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,808 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-12-13 09:37:49,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:49,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:37:49,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:37:49,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:37:49,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,830 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:37:49,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:37:49,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:37:49,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:37:49,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (1/1) ... [2022-12-13 09:37:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:37:49,865 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 09:37:49,891 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 09:37:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:37:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:37:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:37:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:37:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:37:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:37:49,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:37:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:37:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:37:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:37:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:37:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:37:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:37:49,921 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 09:37:50,019 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:37:50,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:37:50,281 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:37:50,384 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:37:50,384 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:37:50,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:50 BoogieIcfgContainer [2022-12-13 09:37:50,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:37:50,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:37:50,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:37:50,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:37:50,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:37:49" (1/3) ... [2022-12-13 09:37:50,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37700a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:50, skipping insertion in model container [2022-12-13 09:37:50,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:49" (2/3) ... [2022-12-13 09:37:50,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37700a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:50, skipping insertion in model container [2022-12-13 09:37:50,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:50" (3/3) ... [2022-12-13 09:37:50,394 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2022-12-13 09:37:50,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:37:50,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:37:50,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:37:50,449 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:37:50,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 09:37:50,522 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 09:37:50,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:50,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 09:37:50,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2022-12-13 09:37:50,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2022-12-13 09:37:50,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:50,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 09:37:50,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2022-12-13 09:37:50,606 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2022-12-13 09:37:50,607 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:50,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 09:37:50,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2022-12-13 09:37:50,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 09:37:56,857 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 09:37:56,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:37:56,877 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;@5475df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:37:56,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:37:56,895 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 09:37:56,895 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:56,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:56,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:37:56,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 392250014, now seen corresponding path program 1 times [2022-12-13 09:37:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52064433] [2022-12-13 09:37:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:57,244 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 09:37:57,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52064433] [2022-12-13 09:37:57,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52064433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:57,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:57,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12113971] [2022-12-13 09:37:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:57,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:57,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2022-12-13 09:37:57,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:57,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:57,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2022-12-13 09:37:57,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:57,581 INFO L130 PetriNetUnfolder]: 944/1804 cut-off events. [2022-12-13 09:37:57,581 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 09:37:57,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1804 events. 944/1804 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 11914 event pairs, 100 based on Foata normal form. 0/1061 useless extension candidates. Maximal degree in co-relation 3365. Up to 1325 conditions per place. [2022-12-13 09:37:57,587 INFO L137 encePairwiseOnDemand]: 40/44 looper letters, 20 selfloop transitions, 2 changer transitions 40/69 dead transitions. [2022-12-13 09:37:57,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 268 flow [2022-12-13 09:37:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 09:37:57,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2022-12-13 09:37:57,596 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2022-12-13 09:37:57,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 268 flow [2022-12-13 09:37:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 69 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:57,601 INFO L231 Difference]: Finished difference. Result has 49 places, 22 transitions, 52 flow [2022-12-13 09:37:57,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2022-12-13 09:37:57,605 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-12-13 09:37:57,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:57,605 INFO L89 Accepts]: Start accepts. Operand has 49 places, 22 transitions, 52 flow [2022-12-13 09:37:57,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:57,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:57,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 22 transitions, 52 flow [2022-12-13 09:37:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2022-12-13 09:37:57,611 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 09:37:57,611 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:57,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 45 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:37:57,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 52 flow [2022-12-13 09:37:57,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 09:37:57,678 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:57,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 09:37:57,680 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2022-12-13 09:37:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:57,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:57,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:37:57,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:57,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1004781460, now seen corresponding path program 1 times [2022-12-13 09:37:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876182618] [2022-12-13 09:37:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:57,873 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 09:37:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876182618] [2022-12-13 09:37:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876182618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:57,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:57,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986464580] [2022-12-13 09:37:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:57,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 09:37:57,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 09:37:57,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:57,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 09:37:57,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:57,962 INFO L130 PetriNetUnfolder]: 171/334 cut-off events. [2022-12-13 09:37:57,962 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 09:37:57,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 334 events. 171/334 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1417 event pairs, 75 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 659. Up to 290 conditions per place. [2022-12-13 09:37:57,966 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 20 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-13 09:37:57,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 116 flow [2022-12-13 09:37:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-13 09:37:57,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 09:37:57,969 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 42 transitions. [2022-12-13 09:37:57,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 116 flow [2022-12-13 09:37:57,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:57,970 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-13 09:37:57,970 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -21 predicate places. [2022-12-13 09:37:57,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:57,971 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:57,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:57,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,975 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 09:37:57,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:57,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2022-12-13 09:37:57,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 09:37:57,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:57,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 09:37:57,993 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 67 flow [2022-12-13 09:37:57,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 09:37:57,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:57,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:57,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:37:57,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:57,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1083455298, now seen corresponding path program 1 times [2022-12-13 09:37:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:57,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426431713] [2022-12-13 09:37:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:58,327 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 09:37:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:58,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426431713] [2022-12-13 09:37:58,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426431713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:58,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:58,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606897255] [2022-12-13 09:37:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:58,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:58,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:37:58,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:58,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:58,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:37:58,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:58,422 INFO L130 PetriNetUnfolder]: 265/467 cut-off events. [2022-12-13 09:37:58,422 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-13 09:37:58,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 467 events. 265/467 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1923 event pairs, 106 based on Foata normal form. 7/350 useless extension candidates. Maximal degree in co-relation 1019. Up to 398 conditions per place. [2022-12-13 09:37:58,424 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-13 09:37:58,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 154 flow [2022-12-13 09:37:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 09:37:58,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2022-12-13 09:37:58,426 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 67 flow. Second operand 4 states and 47 transitions. [2022-12-13 09:37:58,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 154 flow [2022-12-13 09:37:58,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:58,427 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 09:37:58,429 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -17 predicate places. [2022-12-13 09:37:58,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:58,436 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:58,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:58,438 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,445 INFO L130 PetriNetUnfolder]: 5/57 cut-off events. [2022-12-13 09:37:58,445 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 09:37:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 57 events. 5/57 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 218 event pairs, 2 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 85. Up to 14 conditions per place. [2022-12-13 09:37:58,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 09:37:58,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:58,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 09:37:58,473 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 87 flow [2022-12-13 09:37:58,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:58,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:58,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:58,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:37:58,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1917384275, now seen corresponding path program 1 times [2022-12-13 09:37:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:58,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808535673] [2022-12-13 09:37:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:58,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:58,853 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 09:37:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:58,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808535673] [2022-12-13 09:37:58,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808535673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:58,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:58,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276032357] [2022-12-13 09:37:58,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:58,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 09:37:58,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 09:37:58,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:58,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 09:37:58,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:58,942 INFO L130 PetriNetUnfolder]: 178/343 cut-off events. [2022-12-13 09:37:58,942 INFO L131 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-12-13 09:37:58,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 343 events. 178/343 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1429 event pairs, 109 based on Foata normal form. 3/288 useless extension candidates. Maximal degree in co-relation 830. Up to 288 conditions per place. [2022-12-13 09:37:58,944 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 22 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-13 09:37:58,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 167 flow [2022-12-13 09:37:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 09:37:58,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2022-12-13 09:37:58,945 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 87 flow. Second operand 4 states and 51 transitions. [2022-12-13 09:37:58,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 167 flow [2022-12-13 09:37:58,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:58,946 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-13 09:37:58,947 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2022-12-13 09:37:58,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:58,947 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:58,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:58,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,953 INFO L130 PetriNetUnfolder]: 11/62 cut-off events. [2022-12-13 09:37:58,953 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 09:37:58,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 62 events. 11/62 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 229 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 120. Up to 19 conditions per place. [2022-12-13 09:37:58,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 09:37:58,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:58,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 09:37:58,993 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 109 flow [2022-12-13 09:37:58,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 09:37:58,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:58,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:58,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:37:58,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:37:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash -735090216, now seen corresponding path program 1 times [2022-12-13 09:37:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:58,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319817869] [2022-12-13 09:37:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:58,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:59,460 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 09:37:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:59,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319817869] [2022-12-13 09:37:59,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319817869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:59,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:59,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:37:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182828329] [2022-12-13 09:37:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:59,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:37:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:37:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:37:59,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-13 09:37:59,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:59,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:59,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-13 09:37:59,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:59,720 INFO L130 PetriNetUnfolder]: 218/405 cut-off events. [2022-12-13 09:37:59,720 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-13 09:37:59,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 405 events. 218/405 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1652 event pairs, 80 based on Foata normal form. 9/306 useless extension candidates. Maximal degree in co-relation 1070. Up to 332 conditions per place. [2022-12-13 09:37:59,722 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 28 selfloop transitions, 17 changer transitions 0/50 dead transitions. [2022-12-13 09:37:59,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 263 flow [2022-12-13 09:37:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:37:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:37:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-12-13 09:37:59,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2022-12-13 09:37:59,726 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 109 flow. Second operand 7 states and 74 transitions. [2022-12-13 09:37:59,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 263 flow [2022-12-13 09:37:59,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:59,729 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 208 flow [2022-12-13 09:37:59,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-13 09:37:59,731 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 09:37:59,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:59,731 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 208 flow [2022-12-13 09:37:59,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:59,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:59,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 208 flow [2022-12-13 09:37:59,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 208 flow [2022-12-13 09:37:59,776 INFO L130 PetriNetUnfolder]: 25/112 cut-off events. [2022-12-13 09:37:59,777 INFO L131 PetriNetUnfolder]: For 154/157 co-relation queries the response was YES. [2022-12-13 09:37:59,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 112 events. 25/112 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 585 event pairs, 11 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 286. Up to 30 conditions per place. [2022-12-13 09:37:59,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 208 flow [2022-12-13 09:37:59,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-13 09:37:59,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 09:38:00,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L735-->L745: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd1~0_209 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_205 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_578 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_579 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_537 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_205) v_~x$r_buff0_thd1~0_204) (= v_~x$r_buff1_thd1~0_208 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_536 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_204 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_209)) (= (ite .cse3 0 v_~x$w_buff0_used~0_579) v_~x$w_buff0_used~0_578) (= v_~x$w_buff1_used~0_536 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_537)) (= (ite .cse3 v_~x$w_buff0~0_394 (ite .cse4 v_~x$w_buff1~0_358 1)) v_~x~0_483)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_394, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_205, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_537, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_209, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_394, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_204, ~x$w_buff1~0=v_~x$w_buff1~0_358, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_536, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_208, ~x~0=v_~x~0_483, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 09:38:00,357 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:38:00,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 627 [2022-12-13 09:38:00,358 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 214 flow [2022-12-13 09:38:00,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:00,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:00,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:00,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:38:00,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 476601612, now seen corresponding path program 1 times [2022-12-13 09:38:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:00,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022395709] [2022-12-13 09:38:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:00,469 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 09:38:00,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:00,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022395709] [2022-12-13 09:38:00,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022395709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:00,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:00,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002837360] [2022-12-13 09:38:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:00,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 09:38:00,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:00,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:00,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 09:38:00,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:00,546 INFO L130 PetriNetUnfolder]: 237/518 cut-off events. [2022-12-13 09:38:00,546 INFO L131 PetriNetUnfolder]: For 1128/1139 co-relation queries the response was YES. [2022-12-13 09:38:00,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 518 events. 237/518 cut-off events. For 1128/1139 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2685 event pairs, 99 based on Foata normal form. 26/453 useless extension candidates. Maximal degree in co-relation 1670. Up to 250 conditions per place. [2022-12-13 09:38:00,549 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 32 selfloop transitions, 3 changer transitions 9/52 dead transitions. [2022-12-13 09:38:00,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 365 flow [2022-12-13 09:38:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 09:38:00,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-13 09:38:00,550 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 214 flow. Second operand 3 states and 47 transitions. [2022-12-13 09:38:00,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 365 flow [2022-12-13 09:38:00,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 345 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:00,556 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 174 flow [2022-12-13 09:38:00,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-13 09:38:00,558 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-12-13 09:38:00,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:00,558 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 174 flow [2022-12-13 09:38:00,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:00,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:00,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 174 flow [2022-12-13 09:38:00,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 174 flow [2022-12-13 09:38:00,572 INFO L130 PetriNetUnfolder]: 27/157 cut-off events. [2022-12-13 09:38:00,574 INFO L131 PetriNetUnfolder]: For 203/205 co-relation queries the response was YES. [2022-12-13 09:38:00,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 157 events. 27/157 cut-off events. For 203/205 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 924 event pairs, 10 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 364. Up to 46 conditions per place. [2022-12-13 09:38:00,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 174 flow [2022-12-13 09:38:00,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 09:38:00,584 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:00,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:38:00,586 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 174 flow [2022-12-13 09:38:00,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:00,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:00,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:00,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:38:00,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -620067165, now seen corresponding path program 1 times [2022-12-13 09:38:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272265182] [2022-12-13 09:38:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:01,176 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 09:38:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:01,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272265182] [2022-12-13 09:38:01,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272265182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:01,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:01,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740584005] [2022-12-13 09:38:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:01,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:01,178 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:38:01,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:38:01,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:01,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:38:01,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:01,370 INFO L130 PetriNetUnfolder]: 274/562 cut-off events. [2022-12-13 09:38:01,370 INFO L131 PetriNetUnfolder]: For 1043/1054 co-relation queries the response was YES. [2022-12-13 09:38:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 562 events. 274/562 cut-off events. For 1043/1054 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2865 event pairs, 134 based on Foata normal form. 3/464 useless extension candidates. Maximal degree in co-relation 1842. Up to 445 conditions per place. [2022-12-13 09:38:01,372 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 31 selfloop transitions, 8 changer transitions 11/55 dead transitions. [2022-12-13 09:38:01,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 385 flow [2022-12-13 09:38:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 09:38:01,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 09:38:01,374 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 174 flow. Second operand 5 states and 64 transitions. [2022-12-13 09:38:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 385 flow [2022-12-13 09:38:01,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 374 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:01,377 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 221 flow [2022-12-13 09:38:01,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 09:38:01,378 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2022-12-13 09:38:01,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:01,378 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 221 flow [2022-12-13 09:38:01,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:01,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:01,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 221 flow [2022-12-13 09:38:01,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 221 flow [2022-12-13 09:38:01,396 INFO L130 PetriNetUnfolder]: 47/224 cut-off events. [2022-12-13 09:38:01,396 INFO L131 PetriNetUnfolder]: For 345/346 co-relation queries the response was YES. [2022-12-13 09:38:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 224 events. 47/224 cut-off events. For 345/346 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1409 event pairs, 13 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 602. Up to 76 conditions per place. [2022-12-13 09:38:01,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 221 flow [2022-12-13 09:38:01,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-13 09:38:01,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [281] L763-->L766: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:38:01,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L766-->L773: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff1_used~0_99 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_104 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_25) v_~x$r_buff0_thd2~0_24) (= v_~x~0_65 (ite .cse1 v_~x$w_buff0~0_44 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_66))) (= v_~x$w_buff1_used~0_98 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff1_thd2~0_17 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_98 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18)) (= (ite .cse1 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_65, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [281] L763-->L766: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:38:01,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [306] L2-1-->L804: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd0~0_76 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_143 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_76 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_144 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd0~0_75 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_123 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_75 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_76)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_124) v_~x$w_buff1_used~0_123) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_76) v_~x$r_buff0_thd0~0_75) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_80 (ite .cse3 v_~x$w_buff1~0_64 v_~x~0_82))) (= v_~x$w_buff0_used~0_143 (ite .cse4 0 v_~x$w_buff0_used~0_144))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~x$w_buff1~0=v_~x$w_buff1~0_64, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_76, ~x~0=v_~x~0_82, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_144} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_80, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_64, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_123, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_75, ~x~0=v_~x~0_81, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_143} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [281] L763-->L766: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:38:01,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] L738-->L745: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_77 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_78 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_73 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_24) v_~x$r_buff0_thd1~0_23) (= (ite .cse1 0 v_~x$w_buff0_used~0_78) v_~x$w_buff0_used~0_77) (= v_~x$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_72 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= v_~x~0_43 (ite .cse1 v_~x$w_buff0~0_28 (ite .cse4 v_~x$w_buff1~0_27 v_~x~0_44))) (= v_~x$w_buff1_used~0_72 (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_73))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_73, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_77} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [281] L763-->L766: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:38:01,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:01,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-13 09:38:01,602 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 239 flow [2022-12-13 09:38:01,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:38:01,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:01,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:01,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:38:01,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2110543346, now seen corresponding path program 1 times [2022-12-13 09:38:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:01,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839713706] [2022-12-13 09:38:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:02,109 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 09:38:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:02,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839713706] [2022-12-13 09:38:02,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839713706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:02,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:02,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48798708] [2022-12-13 09:38:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:02,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 09:38:02,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 09:38:02,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:02,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 09:38:02,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:02,324 INFO L130 PetriNetUnfolder]: 200/453 cut-off events. [2022-12-13 09:38:02,325 INFO L131 PetriNetUnfolder]: For 977/991 co-relation queries the response was YES. [2022-12-13 09:38:02,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 453 events. 200/453 cut-off events. For 977/991 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2324 event pairs, 66 based on Foata normal form. 7/369 useless extension candidates. Maximal degree in co-relation 1563. Up to 191 conditions per place. [2022-12-13 09:38:02,327 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 31 selfloop transitions, 9 changer transitions 9/54 dead transitions. [2022-12-13 09:38:02,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 385 flow [2022-12-13 09:38:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:38:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:38:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 09:38:02,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4010989010989011 [2022-12-13 09:38:02,328 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 239 flow. Second operand 7 states and 73 transitions. [2022-12-13 09:38:02,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 385 flow [2022-12-13 09:38:02,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 374 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:02,330 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 200 flow [2022-12-13 09:38:02,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2022-12-13 09:38:02,331 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 09:38:02,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:02,331 INFO L89 Accepts]: Start accepts. Operand has 51 places, 32 transitions, 200 flow [2022-12-13 09:38:02,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:02,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:02,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 32 transitions, 200 flow [2022-12-13 09:38:02,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 200 flow [2022-12-13 09:38:02,340 INFO L130 PetriNetUnfolder]: 4/95 cut-off events. [2022-12-13 09:38:02,340 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-13 09:38:02,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 95 events. 4/95 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 3 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 308. Up to 34 conditions per place. [2022-12-13 09:38:02,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 200 flow [2022-12-13 09:38:02,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-13 09:38:02,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L763: Formula: (and (= v_~x$r_buff0_thd2~0_54 1) (= 2 v_~x$w_buff0~0_108) (= v_~x$w_buff0_used~0_183 1) (= v_~x$w_buff0_used~0_184 v_~x$w_buff1_used~0_155) (= v_~x$r_buff1_thd1~0_58 v_~x$r_buff0_thd1~0_57) (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_55) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| 0)) (= v_~x$w_buff0~0_109 v_~x$w_buff1~0_86) (= v_~x$r_buff1_thd0~0_93 v_~x$r_buff0_thd0~0_91) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_155 256) 0)) (not (= (mod v_~x$w_buff0_used~0_183 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_109, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_55, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_184} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_108, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_91, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_15|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_86, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_93, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_183, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [273] L735-->L738: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 09:38:02,627 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:38:02,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 09:38:02,628 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 221 flow [2022-12-13 09:38:02,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 09:38:02,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:02,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:02,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:38:02,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2110531256, now seen corresponding path program 2 times [2022-12-13 09:38:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:02,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422302316] [2022-12-13 09:38:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:02,940 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 09:38:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:02,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422302316] [2022-12-13 09:38:02,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422302316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:02,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:02,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:38:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253193012] [2022-12-13 09:38:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:02,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:38:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:38:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:38:02,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 09:38:02,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:38:02,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:02,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 09:38:02,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:03,080 INFO L130 PetriNetUnfolder]: 180/410 cut-off events. [2022-12-13 09:38:03,080 INFO L131 PetriNetUnfolder]: For 986/997 co-relation queries the response was YES. [2022-12-13 09:38:03,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 410 events. 180/410 cut-off events. For 986/997 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2069 event pairs, 161 based on Foata normal form. 3/326 useless extension candidates. Maximal degree in co-relation 1504. Up to 334 conditions per place. [2022-12-13 09:38:03,083 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 16 selfloop transitions, 4 changer transitions 12/37 dead transitions. [2022-12-13 09:38:03,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 37 transitions, 312 flow [2022-12-13 09:38:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-13 09:38:03,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 09:38:03,084 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 221 flow. Second operand 5 states and 54 transitions. [2022-12-13 09:38:03,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 37 transitions, 312 flow [2022-12-13 09:38:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 288 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 09:38:03,088 INFO L231 Difference]: Finished difference. Result has 51 places, 25 transitions, 164 flow [2022-12-13 09:38:03,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=51, PETRI_TRANSITIONS=25} [2022-12-13 09:38:03,089 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-12-13 09:38:03,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:03,089 INFO L89 Accepts]: Start accepts. Operand has 51 places, 25 transitions, 164 flow [2022-12-13 09:38:03,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:03,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:03,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 25 transitions, 164 flow [2022-12-13 09:38:03,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 25 transitions, 164 flow [2022-12-13 09:38:03,096 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 09:38:03,097 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-12-13 09:38:03,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 47 events. 3/47 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 2 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 147. Up to 18 conditions per place. [2022-12-13 09:38:03,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 25 transitions, 164 flow [2022-12-13 09:38:03,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-13 09:38:03,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:03,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 287 [2022-12-13 09:38:03,376 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 24 transitions, 158 flow [2022-12-13 09:38:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 09:38:03,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:03,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:38:03,376 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 792612037, now seen corresponding path program 1 times [2022-12-13 09:38:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:03,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184895592] [2022-12-13 09:38:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:03,474 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 09:38:03,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184895592] [2022-12-13 09:38:03,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184895592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:03,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:03,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362982944] [2022-12-13 09:38:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:03,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:03,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-13 09:38:03,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 24 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:38:03,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:03,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-13 09:38:03,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:03,542 INFO L130 PetriNetUnfolder]: 104/257 cut-off events. [2022-12-13 09:38:03,542 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-12-13 09:38:03,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 257 events. 104/257 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1237 event pairs, 35 based on Foata normal form. 5/188 useless extension candidates. Maximal degree in co-relation 1043. Up to 226 conditions per place. [2022-12-13 09:38:03,543 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 21 selfloop transitions, 7 changer transitions 1/32 dead transitions. [2022-12-13 09:38:03,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 242 flow [2022-12-13 09:38:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-13 09:38:03,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-13 09:38:03,545 INFO L175 Difference]: Start difference. First operand has 46 places, 24 transitions, 158 flow. Second operand 3 states and 38 transitions. [2022-12-13 09:38:03,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 242 flow [2022-12-13 09:38:03,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 184 flow, removed 20 selfloop flow, removed 11 redundant places. [2022-12-13 09:38:03,547 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 153 flow [2022-12-13 09:38:03,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-13 09:38:03,547 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2022-12-13 09:38:03,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:03,548 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 153 flow [2022-12-13 09:38:03,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:03,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:03,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 153 flow [2022-12-13 09:38:03,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 153 flow [2022-12-13 09:38:03,558 INFO L130 PetriNetUnfolder]: 36/152 cut-off events. [2022-12-13 09:38:03,559 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2022-12-13 09:38:03,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 152 events. 36/152 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 834 event pairs, 15 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 390. Up to 85 conditions per place. [2022-12-13 09:38:03,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 153 flow [2022-12-13 09:38:03,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-13 09:38:04,047 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:38:04,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 499 [2022-12-13 09:38:04,048 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 170 flow [2022-12-13 09:38:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 09:38:04,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:04,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:38:04,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -611725685, now seen corresponding path program 1 times [2022-12-13 09:38:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:04,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404537464] [2022-12-13 09:38:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:04,306 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 09:38:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404537464] [2022-12-13 09:38:04,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404537464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:04,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:04,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096564160] [2022-12-13 09:38:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:04,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:04,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-13 09:38:04,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 09:38:04,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:04,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-13 09:38:04,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:04,398 INFO L130 PetriNetUnfolder]: 81/225 cut-off events. [2022-12-13 09:38:04,398 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-13 09:38:04,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 225 events. 81/225 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1109 event pairs, 43 based on Foata normal form. 3/194 useless extension candidates. Maximal degree in co-relation 801. Up to 194 conditions per place. [2022-12-13 09:38:04,399 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 21 selfloop transitions, 1 changer transitions 6/32 dead transitions. [2022-12-13 09:38:04,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 247 flow [2022-12-13 09:38:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 09:38:04,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-13 09:38:04,401 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 170 flow. Second operand 4 states and 37 transitions. [2022-12-13 09:38:04,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 247 flow [2022-12-13 09:38:04,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 220 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:04,402 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 137 flow [2022-12-13 09:38:04,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-13 09:38:04,403 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2022-12-13 09:38:04,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:04,403 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 137 flow [2022-12-13 09:38:04,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:04,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:04,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 137 flow [2022-12-13 09:38:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 137 flow [2022-12-13 09:38:04,415 INFO L130 PetriNetUnfolder]: 36/156 cut-off events. [2022-12-13 09:38:04,415 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 09:38:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 156 events. 36/156 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 897 event pairs, 15 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 403. Up to 85 conditions per place. [2022-12-13 09:38:04,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 137 flow [2022-12-13 09:38:04,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 09:38:04,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L773: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_640 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd2~0_202 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_638 256) 0)))) (and (= |v_P1Thread1of1ForFork0_~arg#1.base_40| |v_P1Thread1of1ForFork0_#in~arg#1.base_40|) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_200) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48| (ite .cse1 1 0)) (= v_~x$w_buff1_used~0_593 (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~x$w_buff0_used~0_640)) (= v_~x$w_buff0~0_428 v_~x~0_536) (= v_~x$w_buff0_used~0_638 0) (= v_~x$r_buff0_thd1~0_228 v_~x$r_buff1_thd1~0_234) (= (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_593 256) 0))) (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_200 256) 0)))) 0 v_~x$r_buff0_thd2~0_202) v_~x$r_buff1_thd2~0_146) (= v_~x$w_buff0~0_429 v_~x$w_buff1~0_388) (= 2 v_~x$w_buff0~0_428) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48| 0)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_40| |v_P1Thread1of1ForFork0_~arg#1.offset_40|) (= v_~x$r_buff0_thd0~0_380 v_~x$r_buff1_thd0~0_387) (= v_~y~0_151 1))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_429, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_380, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_228, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_202, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_640} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_428, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_380, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_48|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_228, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_40|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_40|, ~x$w_buff1~0=v_~x$w_buff1~0_388, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_146, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_234, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_48|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_200, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_387, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~y~0=v_~y~0_151, ~x~0=v_~x~0_536} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0, ~x~0] and [330] $Ultimate##0-->L735: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_29 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_29, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:38:04,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:04,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 09:38:04,647 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 139 flow [2022-12-13 09:38:04,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 09:38:04,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:04,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:04,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:38:04,647 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1082804081, now seen corresponding path program 1 times [2022-12-13 09:38:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:04,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308444778] [2022-12-13 09:38:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:04,725 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 09:38:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:04,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308444778] [2022-12-13 09:38:04,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308444778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:04,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:04,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11279234] [2022-12-13 09:38:04,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:04,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:04,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:04,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-13 09:38:04,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:04,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:04,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-13 09:38:04,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:04,775 INFO L130 PetriNetUnfolder]: 9/68 cut-off events. [2022-12-13 09:38:04,776 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 09:38:04,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 68 events. 9/68 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 253 event pairs, 0 based on Foata normal form. 21/73 useless extension candidates. Maximal degree in co-relation 238. Up to 46 conditions per place. [2022-12-13 09:38:04,776 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 10 selfloop transitions, 13 changer transitions 0/25 dead transitions. [2022-12-13 09:38:04,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 25 transitions, 173 flow [2022-12-13 09:38:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-13 09:38:04,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 09:38:04,777 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 139 flow. Second operand 4 states and 33 transitions. [2022-12-13 09:38:04,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 25 transitions, 173 flow [2022-12-13 09:38:04,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 139 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 09:38:04,778 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 131 flow [2022-12-13 09:38:04,778 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 09:38:04,779 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -20 predicate places. [2022-12-13 09:38:04,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:04,779 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 131 flow [2022-12-13 09:38:04,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:04,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:04,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 131 flow [2022-12-13 09:38:04,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 131 flow [2022-12-13 09:38:04,785 INFO L130 PetriNetUnfolder]: 9/68 cut-off events. [2022-12-13 09:38:04,785 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 09:38:04,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 68 events. 9/68 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 254 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 171. Up to 34 conditions per place. [2022-12-13 09:38:04,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 131 flow [2022-12-13 09:38:04,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-13 09:38:04,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] $Ultimate##0-->L776: Formula: (let ((.cse1 (not (= 0 (mod v_~x$r_buff0_thd2~0_211 256)))) (.cse2 (= (mod v_~x$w_buff0_used~0_665 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_664 256) 0)))) (and (= v_~x$w_buff0~0_443 v_~x~0_559) (= 2 v_~x$w_buff0~0_443) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_210) (= v_~x$r_buff1_thd2~0_152 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_615 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_210 256) 0)) .cse0)) 0 v_~x$r_buff0_thd2~0_211)) (= |v_P1Thread1of1ForFork0_~arg#1.base_44| |v_P1Thread1of1ForFork0_#in~arg#1.base_44|) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_52|) (= v_~x$w_buff0~0_444 v_~x$w_buff1~0_399) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_52| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_52| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_52|) (= v_~x$r_buff0_thd0~0_395 v_~x$r_buff1_thd0~0_401) (= v_~__unbuffered_cnt~0_337 (+ v_~__unbuffered_cnt~0_338 1)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_44| |v_P1Thread1of1ForFork0_~arg#1.offset_44|) (= v_~x$w_buff1_used~0_615 (ite (or (and .cse1 (not .cse2)) .cse0) 0 v_~x$w_buff0_used~0_665)) (= v_~y~0_155 1) (= v_~x$r_buff0_thd1~0_245 v_~x$r_buff1_thd1~0_251) (= v_~x$w_buff0_used~0_664 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_444, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_395, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_245, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_338, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_665} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_443, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_395, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_52|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_245, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_44|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_44|, ~x$w_buff1~0=v_~x$w_buff1~0_399, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_615, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_251, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_52|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_401, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_664, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_337, ~y~0=v_~y~0_155, ~x~0=v_~x~0_559} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_cnt~0, ~y~0, ~x~0] and [415] $Ultimate##0-->L738: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_171 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~x~0_587 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_171, ~x~0=v_~x~0_587, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:38:05,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [410] $Ultimate##0-->P1FINAL: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff0_thd2~0_215 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_669 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_668 256) 0)))) (and (= |v_P1Thread1of1ForFork0_#res#1.base_57| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_57| 0) (= v_~__unbuffered_cnt~0_341 (+ v_~__unbuffered_cnt~0_342 1)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| 0)) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_214 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_617 256) 0)))) 0 v_~x$r_buff0_thd2~0_215) v_~x$r_buff1_thd2~0_154) (= v_~x$w_buff0~0_447 v_~x~0_561) (= v_~x$r_buff0_thd0~0_397 v_~x$r_buff1_thd0~0_403) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (= v_~x$w_buff0_used~0_668 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|) (= v_~y~0_157 1) (= v_~x$w_buff0~0_448 v_~x$w_buff1~0_401) (= v_~x$r_buff0_thd1~0_247 v_~x$r_buff1_thd1~0_253) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_46| |v_P1Thread1of1ForFork0_~arg#1.offset_46|) (= v_~x$w_buff1_used~0_617 (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~x$w_buff0_used~0_669)) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_214) (= 2 v_~x$w_buff0~0_447) (= |v_P1Thread1of1ForFork0_~arg#1.base_46| |v_P1Thread1of1ForFork0_#in~arg#1.base_46|))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_448, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_397, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_247, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_342, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_215, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_669} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_447, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_397, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_54|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_247, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_46|, ~x$w_buff1~0=v_~x$w_buff1~0_401, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_617, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_253, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_54|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_214, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_403, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_341, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_57|, ~y~0=v_~y~0_157, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_57|, ~x~0=v_~x~0_561} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~y~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0] and [415] $Ultimate##0-->L738: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_171 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~x~0_587 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_171, ~x~0=v_~x~0_587, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:38:05,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] $Ultimate##0-->P1EXIT: Formula: (let ((.cse2 (= (mod v_~x$w_buff0_used~0_673 256) 0)) (.cse1 (not (= (mod v_~x$r_buff0_thd2~0_219 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_672 256) 0)))) (and (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_218 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_619 256) 0)) .cse1)) 0 v_~x$r_buff0_thd2~0_219) v_~x$r_buff1_thd2~0_156) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_56|) (= v_~x$r_buff0_thd0~0_399 v_~x$r_buff1_thd0~0_405) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_48| |v_P1Thread1of1ForFork0_~arg#1.offset_48|) (= v_~__unbuffered_cnt~0_345 (+ v_~__unbuffered_cnt~0_346 1)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_56| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_56|) (= v_~x$w_buff0_used~0_672 0) (= (ite (or .cse0 (and (not .cse2) .cse1)) 0 v_~x$w_buff0_used~0_673) v_~x$w_buff1_used~0_619) (= v_~x$w_buff0~0_452 v_~x$w_buff1~0_403) (= v_~x$r_buff0_thd1~0_249 v_~x$r_buff1_thd1~0_255) (= v_~y~0_159 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_56| 0)) (= |v_P1Thread1of1ForFork0_#res#1.offset_59| 0) (= |v_P1Thread1of1ForFork0_#res#1.base_59| 0) (= v_~x$w_buff0~0_451 v_~x~0_563) (= |v_P1Thread1of1ForFork0_~arg#1.base_48| |v_P1Thread1of1ForFork0_#in~arg#1.base_48|) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_218) (= 2 v_~x$w_buff0~0_451))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_452, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_399, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_48|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_249, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_346, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_219, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_48|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_673} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_451, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_399, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_56|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_249, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_48|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_48|, ~x$w_buff1~0=v_~x$w_buff1~0_403, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_156, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_619, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_255, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_56|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_218, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_405, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_48|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_345, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_59|, ~y~0=v_~y~0_159, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_59|, ~x~0=v_~x~0_563} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~y~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0] and [415] $Ultimate##0-->L738: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_171 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23) (= v_~x~0_587 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_171, ~x~0=v_~x~0_587, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 09:38:08,118 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:38:08,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3340 [2022-12-13 09:38:08,119 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 121 flow [2022-12-13 09:38:08,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:08,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:08,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:08,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:38:08,120 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:38:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1004751623, now seen corresponding path program 1 times [2022-12-13 09:38:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549113122] [2022-12-13 09:38:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:08,383 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 09:38:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:08,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549113122] [2022-12-13 09:38:08,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549113122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:08,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:08,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853116022] [2022-12-13 09:38:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:08,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:08,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:08,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 16 [2022-12-13 09:38:08,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:08,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:08,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 16 [2022-12-13 09:38:08,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:08,406 INFO L130 PetriNetUnfolder]: 9/30 cut-off events. [2022-12-13 09:38:08,406 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 09:38:08,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 30 events. 9/30 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 82 event pairs, 0 based on Foata normal form. 9/30 useless extension candidates. Maximal degree in co-relation 127. Up to 25 conditions per place. [2022-12-13 09:38:08,406 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2022-12-13 09:38:08,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 141 flow [2022-12-13 09:38:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-13 09:38:08,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-13 09:38:08,407 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 121 flow. Second operand 4 states and 25 transitions. [2022-12-13 09:38:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 141 flow [2022-12-13 09:38:08,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 91 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 09:38:08,407 INFO L231 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow [2022-12-13 09:38:08,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0} [2022-12-13 09:38:08,408 INFO L295 CegarLoopForPetriNet]: 51 programPoint places, -28 predicate places. [2022-12-13 09:38:08,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:08,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 0 transitions, 0 flow [2022-12-13 09:38:08,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:08,409 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:38:08,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:08,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:38:08,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:08,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:38:08,409 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:08,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 09:38:08,410 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:08,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:08,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:38:08,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 09:38:08,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:38:08,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:38:08,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 09:38:08,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:38:08,412 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:08,416 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:38:08,416 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:38:08,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:38:08 BasicIcfg [2022-12-13 09:38:08,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:38:08,418 INFO L158 Benchmark]: Toolchain (without parser) took 19131.85ms. Allocated memory was 179.3MB in the beginning and 607.1MB in the end (delta: 427.8MB). Free memory was 138.5MB in the beginning and 445.2MB in the end (delta: -306.8MB). Peak memory consumption was 122.6MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,418 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:08,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.35ms. Allocated memory is still 179.3MB. Free memory was 138.5MB in the beginning and 113.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.47ms. Allocated memory is still 179.3MB. Free memory was 113.8MB in the beginning and 111.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,419 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 179.3MB. Free memory was 111.2MB in the beginning and 109.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,419 INFO L158 Benchmark]: RCFGBuilder took 552.85ms. Allocated memory is still 179.3MB. Free memory was 109.6MB in the beginning and 78.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,419 INFO L158 Benchmark]: TraceAbstraction took 18029.70ms. Allocated memory was 179.3MB in the beginning and 607.1MB in the end (delta: 427.8MB). Free memory was 77.1MB in the beginning and 445.2MB in the end (delta: -368.1MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-12-13 09:38:08,420 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.12ms. Allocated memory is still 179.3MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.35ms. Allocated memory is still 179.3MB. Free memory was 138.5MB in the beginning and 113.8MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.47ms. Allocated memory is still 179.3MB. Free memory was 113.8MB in the beginning and 111.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 179.3MB. Free memory was 111.2MB in the beginning and 109.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 552.85ms. Allocated memory is still 179.3MB. Free memory was 109.6MB in the beginning and 78.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18029.70ms. Allocated memory was 179.3MB in the beginning and 607.1MB in the end (delta: 427.8MB). Free memory was 77.1MB in the beginning and 445.2MB in the end (delta: -368.1MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 89 PlacesBefore, 51 PlacesAfterwards, 84 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 32 ConcurrentYvCompositions, 3 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1733, independent: 1602, independent conditional: 1602, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1091, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1091, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1091, independent: 1019, independent conditional: 0, independent unconditional: 1019, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 372, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 357, dependent conditional: 0, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1733, independent: 562, independent conditional: 562, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 1091, unknown conditional: 1091, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1045, Positive conditional cache size: 1045, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 92, independent conditional: 6, independent unconditional: 86, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 92, independent conditional: 6, independent unconditional: 86, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 52, dependent conditional: 4, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 110, unknown conditional: 110, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 92, Positive conditional cache size: 92, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 26, independent conditional: 3, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 26, independent conditional: 3, independent unconditional: 23, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 118, Positive conditional cache size: 118, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 125, Positive conditional cache size: 125, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 127, Positive conditional cache size: 127, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 45 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 9, independent unconditional: 3, 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: 14, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 49 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 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] ], Cache Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 153, Positive conditional cache size: 153, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 48 PlacesBefore, 46 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 156, Positive conditional cache size: 156, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 37 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 174, Positive conditional cache size: 174, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 174, Positive conditional cache size: 174, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 31 PlacesBefore, 26 PlacesAfterwards, 24 TransitionsBefore, 19 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 7, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 183, Positive conditional cache size: 183, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 183, Positive conditional cache size: 183, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 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.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 20 mSDtfsCounter, 729 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=7, InterpolantAutomatonStates: 56, 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, 3.5s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:38:08,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...