/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/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:22:25,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:22:25,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:22:25,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:22:25,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:22:25,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:22:25,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:22:25,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:22:25,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:22:25,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:22:25,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:22:25,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:22:25,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:22:25,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:22:25,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:22:25,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:22:25,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:22:25,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:22:25,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:22:25,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:22:25,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:22:25,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:22:25,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:22:25,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:22:25,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:22:25,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:22:25,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:22:25,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:22:25,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:22:25,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:22:25,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:22:25,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:22:25,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:22:25,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:22:25,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:22:25,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:22:25,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:22:25,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:22:25,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:22:25,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:22:25,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:22:25,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:22:25,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:22:25,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:22:25,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:22:25,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:22:25,845 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:22:25,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:22:25,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:22:25,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:22:25,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:22:25,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:22:25,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:22:25,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:22:25,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:22:25,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:22:25,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:22:25,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:22:25,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:22:26,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:22:26,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:22:26,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:22:26,176 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:22:26,177 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:22:26,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 05:22:27,305 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:22:27,537 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:22:27,538 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-12-06 05:22:27,562 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c7b41dd/98369411c8ad4d07be64672d4517f948/FLAG4d463d8e0 [2022-12-06 05:22:27,576 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c7b41dd/98369411c8ad4d07be64672d4517f948 [2022-12-06 05:22:27,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:22:27,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:22:27,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:22:27,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:22:27,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:22:27,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6064dffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27, skipping insertion in model container [2022-12-06 05:22:27,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:22:27,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:22:27,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,768 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 05:22:27,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:22:27,790 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:22:27,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:22:27,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:22:27,837 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-12-06 05:22:27,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:22:27,856 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:22:27,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27 WrapperNode [2022-12-06 05:22:27,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:22:27,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:22:27,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:22:27,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:22:27,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,916 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-12-06 05:22:27,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:22:27,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:22:27,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:22:27,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:22:27,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,958 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:22:27,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:22:27,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:22:27,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:22:27,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (1/1) ... [2022-12-06 05:22:27,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:22:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:28,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:22:28,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:22:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:22:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:22:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:22:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:22:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:22:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:22:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:22:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:22:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:22:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:22:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:22:28,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:22:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:22:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:22:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:22:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:22:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:22:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:22:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:22:28,086 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:22:28,203 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:22:28,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:22:28,759 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:22:28,973 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:22:28,974 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-06 05:22:28,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:22:28 BoogieIcfgContainer [2022-12-06 05:22:28,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:22:28,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:22:28,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:22:28,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:22:28,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:22:27" (1/3) ... [2022-12-06 05:22:28,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29188ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:22:28, skipping insertion in model container [2022-12-06 05:22:28,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:22:27" (2/3) ... [2022-12-06 05:22:28,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29188ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:22:28, skipping insertion in model container [2022-12-06 05:22:28,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:22:28" (3/3) ... [2022-12-06 05:22:28,985 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-12-06 05:22:28,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:22:28,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:22:28,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:22:29,163 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 05:22:29,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 05:22:29,373 INFO L130 PetriNetUnfolder]: 37/327 cut-off events. [2022-12-06 05:22:29,374 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:22:29,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 327 events. 37/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 05:22:29,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 331 transitions, 694 flow [2022-12-06 05:22:29,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 291 places, 315 transitions, 654 flow [2022-12-06 05:22:29,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:29,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 05:22:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 315 transitions, 654 flow [2022-12-06 05:22:29,480 INFO L130 PetriNetUnfolder]: 37/315 cut-off events. [2022-12-06 05:22:29,480 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:22:29,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 315 events. 37/315 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 285. Up to 8 conditions per place. [2022-12-06 05:22:29,488 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 315 transitions, 654 flow [2022-12-06 05:22:29,488 INFO L188 LiptonReduction]: Number of co-enabled transitions 5184 [2022-12-06 05:22:41,330 INFO L203 LiptonReduction]: Total number of compositions: 274 [2022-12-06 05:22:41,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:22:41,347 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;@73952026, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:22:41,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 05:22:41,353 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 05:22:41,353 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:22:41,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:41,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:41,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1058262679, now seen corresponding path program 1 times [2022-12-06 05:22:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:41,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044085200] [2022-12-06 05:22:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:41,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044085200] [2022-12-06 05:22:41,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044085200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:41,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:41,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:22:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107778381] [2022-12-06 05:22:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:22:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:41,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:22:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:22:41,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:41,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 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-06 05:22:41,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:41,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:41,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:42,116 INFO L130 PetriNetUnfolder]: 501/685 cut-off events. [2022-12-06 05:22:42,116 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-06 05:22:42,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 685 events. 501/685 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1774 event pairs, 117 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 05:22:42,120 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 49 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-12-06 05:22:42,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 265 flow [2022-12-06 05:22:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 05:22:42,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2022-12-06 05:22:42,129 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 56 transitions. [2022-12-06 05:22:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 265 flow [2022-12-06 05:22:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 235 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 05:22:42,134 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2022-12-06 05:22:42,137 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 05:22:42,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:42,138 INFO L89 Accepts]: Start accepts. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:42,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:42,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,147 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1652] L154-1-->L154-1: Formula: (let ((.cse2 (= v_~client_state~0_In_4 1)) (.cse3 (= v_~manager_back~0_In_12 v_~manager_back~0_Out_28)) (.cse5 (= |v_thread4Thread1of1ForFork2_#t~post26#1_Out_8| |v_thread4Thread1of1ForFork2_#t~post26#1_In_3|)) (.cse8 (= |v_thread4Thread1of1ForFork2_#t~mem25#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|)) (.cse9 (= v_~client_state~0_In_4 0)) (.cse0 (= v_~safe~0_Out_36 v_~safe~0_In_10)) (.cse1 (= |v_thread4Thread1of1ForFork2_#t~mem27#1_In_3| |v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|)) (.cse4 (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1| 256) 0))) (.cse6 (= |v_thread4Thread1of1ForFork2_#t~post28#1_In_3| |v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|)) (.cse10 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse7 (= v_~client_front~0_In_6 v_~client_front~0_Out_20)) (.cse11 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|))) (or (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|) .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_~client_state~0_Out_14 v_~client_state~0_In_4) (not .cse9) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|)) (and (= (ite (= (ite (= v_~ok~0_In_10 (select (select |v_#memory_int_In_42| v_~client~0.base_In_5) (+ (* v_~client_front~0_In_6 4) v_~client~0.offset_In_5))) 1 0) 0) 0 1) v_~safe~0_Out_36) .cse2 (= (+ v_~client_front~0_In_6 1) v_~client_front~0_Out_20) .cse3 .cse4 .cse5 .cse10 .cse8 .cse11 (= v_~client_state~0_Out_14 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (< v_~client_back~0_In_5 v_~client_size~0_In_6) (<= 0 v_~client_front~0_In_6) (< v_~client_front~0_In_6 v_~client_back~0_In_5)) 1 0))) (and (not (= (ite (and (<= 0 v_~manager_back~0_In_12) (< v_~manager_back~0_In_12 v_~manager_size~0_In_14)) 1 0) 0)) .cse9 (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10| (ite (= v_~update~0_In_14 (select (select |v_#memory_int_In_42| v_~manager~0.base_In_12) (+ (* v_~manager_back~0_In_12 4) v_~manager~0.offset_In_12))) 1 0)) .cse0 .cse1 (= v_~client_state~0_Out_14 1) .cse4 .cse6 (= v_~manager_back~0_Out_28 (+ v_~manager_back~0_In_12 1)) .cse10 .cse7 .cse11))) InVars {~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~nondet24#1=|v_thread4Thread1of1ForFork2_#t~nondet24#1_In_1|, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_In_3|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|, ~manager_back~0=v_~manager_back~0_In_12, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_In_3|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_In_3|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_In_3|, ~client_front~0=v_~client_front~0_In_6, ~safe~0=v_~safe~0_In_10, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_In_4, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} OutVars{~client~0.offset=v_~client~0.offset_In_5, ~client_back~0=v_~client_back~0_In_5, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|, ~manager~0.offset=v_~manager~0.offset_In_12, ~ok~0=v_~ok~0_In_10, ~manager~0.base=v_~manager~0.base_In_12, thread4Thread1of1ForFork2_#t~post26#1=|v_thread4Thread1of1ForFork2_#t~post26#1_Out_8|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_10|, ~manager_back~0=v_~manager_back~0_Out_28, thread4Thread1of1ForFork2_#t~mem27#1=|v_thread4Thread1of1ForFork2_#t~mem27#1_Out_8|, thread4Thread1of1ForFork2_#t~post28#1=|v_thread4Thread1of1ForFork2_#t~post28#1_Out_8|, thread4Thread1of1ForFork2_#t~mem25#1=|v_thread4Thread1of1ForFork2_#t~mem25#1_Out_8|, ~client_front~0=v_~client_front~0_Out_20, ~safe~0=v_~safe~0_Out_36, #memory_int=|v_#memory_int_In_42|, ~client_state~0=v_~client_state~0_Out_14, ~client_size~0=v_~client_size~0_In_6, ~manager_size~0=v_~manager_size~0_In_14, ~client~0.base=v_~client~0.base_In_5, ~update~0=v_~update~0_In_14} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~client_front~0, ~safe~0, thread4Thread1of1ForFork2_#t~nondet24#1, thread4Thread1of1ForFork2_#t~post26#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~manager_back~0, ~client_state~0, thread4Thread1of1ForFork2_#t~mem27#1, thread4Thread1of1ForFork2_#t~post28#1, thread4Thread1of1ForFork2_#t~mem25#1][26], [310#true, 141#L110-1true, 80#L154-1true, 175#L132-1true, 86#L199-4true, Black: 312#(= ~safe~0 1), 89#L88-1true]) [2022-12-06 05:22:42,147 INFO L382 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2022-12-06 05:22:42,147 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:22:42,147 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:22:42,147 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-06 05:22:42,151 INFO L130 PetriNetUnfolder]: 23/63 cut-off events. [2022-12-06 05:22:42,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:22:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 63 events. 23/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-06 05:22:42,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 05:22:42,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:42,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:22:42,153 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 107 flow [2022-12-06 05:22:42,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 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-06 05:22:42,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:42,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:42,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:22:42,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1410111894, now seen corresponding path program 1 times [2022-12-06 05:22:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:42,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24944363] [2022-12-06 05:22:42,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24944363] [2022-12-06 05:22:42,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24944363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477352231] [2022-12-06 05:22:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:42,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:42,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:42,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:42,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:22:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:42,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:22:42,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:43,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:22:43,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477352231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:43,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:22:43,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2022-12-06 05:22:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157817116] [2022-12-06 05:22:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:43,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:22:43,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:22:43,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:22:43,066 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:43,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:43,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:43,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:43,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:43,211 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-06 05:22:43,211 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-06 05:22:43,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 647 events. 467/647 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1704 event pairs, 117 based on Foata normal form. 30/673 useless extension candidates. Maximal degree in co-relation 471. Up to 433 conditions per place. [2022-12-06 05:22:43,215 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2022-12-06 05:22:43,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 244 flow [2022-12-06 05:22:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 05:22:43,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-06 05:22:43,216 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 107 flow. Second operand 3 states and 53 transitions. [2022-12-06 05:22:43,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 244 flow [2022-12-06 05:22:43,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:43,218 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-06 05:22:43,219 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-06 05:22:43,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:43,219 INFO L89 Accepts]: Start accepts. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,220 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:43,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:43,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,227 INFO L130 PetriNetUnfolder]: 18/54 cut-off events. [2022-12-06 05:22:43,228 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:22:43,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 54 events. 18/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 43. Up to 17 conditions per place. [2022-12-06 05:22:43,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:22:43,229 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:43,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:22:43,230 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 106 flow [2022-12-06 05:22:43,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:43,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:43,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:43,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:22:43,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:43,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 573276739, now seen corresponding path program 1 times [2022-12-06 05:22:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:43,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883683781] [2022-12-06 05:22:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:43,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883683781] [2022-12-06 05:22:43,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883683781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:43,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:43,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381150048] [2022-12-06 05:22:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:43,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:43,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:43,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:43,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 6.5) 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-06 05:22:43,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:43,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:43,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:43,988 INFO L130 PetriNetUnfolder]: 1278/1817 cut-off events. [2022-12-06 05:22:43,988 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2022-12-06 05:22:43,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1817 events. 1278/1817 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6192 event pairs, 801 based on Foata normal form. 120/1926 useless extension candidates. Maximal degree in co-relation 1325. Up to 648 conditions per place. [2022-12-06 05:22:43,998 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 92 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2022-12-06 05:22:43,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 100 transitions, 482 flow [2022-12-06 05:22:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:22:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:22:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 05:22:44,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 05:22:44,002 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 106 flow. Second operand 5 states and 95 transitions. [2022-12-06 05:22:44,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 100 transitions, 482 flow [2022-12-06 05:22:44,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 100 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:44,006 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 164 flow [2022-12-06 05:22:44,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2022-12-06 05:22:44,008 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-06 05:22:44,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:44,008 INFO L89 Accepts]: Start accepts. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 05:22:44,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:44,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:44,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 05:22:44,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 43 transitions, 164 flow [2022-12-06 05:22:44,024 INFO L130 PetriNetUnfolder]: 37/140 cut-off events. [2022-12-06 05:22:44,025 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 05:22:44,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 140 events. 37/140 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 430 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 125. Up to 35 conditions per place. [2022-12-06 05:22:44,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 43 transitions, 164 flow [2022-12-06 05:22:44,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:22:49,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:49,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5176 [2022-12-06 05:22:49,184 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 170 flow [2022-12-06 05:22:49,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) 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-06 05:22:49,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:49,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:49,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:22:49,185 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -93352592, now seen corresponding path program 1 times [2022-12-06 05:22:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753428243] [2022-12-06 05:22:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753428243] [2022-12-06 05:22:49,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753428243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:49,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:49,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:49,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550476483] [2022-12-06 05:22:49,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:49,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:49,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:49,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 05:22:49,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 6.25) 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-06 05:22:49,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:49,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 05:22:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:49,873 INFO L130 PetriNetUnfolder]: 2274/3257 cut-off events. [2022-12-06 05:22:49,873 INFO L131 PetriNetUnfolder]: For 1290/1290 co-relation queries the response was YES. [2022-12-06 05:22:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 3257 events. 2274/3257 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13307 event pairs, 777 based on Foata normal form. 204/3459 useless extension candidates. Maximal degree in co-relation 4835. Up to 1469 conditions per place. [2022-12-06 05:22:49,887 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 74 selfloop transitions, 4 changer transitions 1/79 dead transitions. [2022-12-06 05:22:49,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 79 transitions, 434 flow [2022-12-06 05:22:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 05:22:49,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-06 05:22:49,891 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 170 flow. Second operand 4 states and 73 transitions. [2022-12-06 05:22:49,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 79 transitions, 434 flow [2022-12-06 05:22:49,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 79 transitions, 426 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:49,898 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 179 flow [2022-12-06 05:22:49,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2022-12-06 05:22:49,899 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 05:22:49,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:49,899 INFO L89 Accepts]: Start accepts. Operand has 43 places, 43 transitions, 179 flow [2022-12-06 05:22:49,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:49,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:49,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 43 transitions, 179 flow [2022-12-06 05:22:49,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 179 flow [2022-12-06 05:22:49,925 INFO L130 PetriNetUnfolder]: 41/189 cut-off events. [2022-12-06 05:22:49,925 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 05:22:49,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 189 events. 41/189 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 775 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 52 conditions per place. [2022-12-06 05:22:49,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 179 flow [2022-12-06 05:22:49,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:22:49,928 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:49,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 05:22:49,930 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 179 flow [2022-12-06 05:22:49,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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-06 05:22:49,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:49,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:49,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:22:49,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1074394720, now seen corresponding path program 1 times [2022-12-06 05:22:49,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924961724] [2022-12-06 05:22:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:50,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924961724] [2022-12-06 05:22:50,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924961724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:50,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:50,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874820834] [2022-12-06 05:22:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:50,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:50,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:50,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:22:50,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 6.25) 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-06 05:22:50,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:50,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:22:50,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:50,394 INFO L130 PetriNetUnfolder]: 1078/1592 cut-off events. [2022-12-06 05:22:50,395 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-06 05:22:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1592 events. 1078/1592 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5769 event pairs, 761 based on Foata normal form. 72/1663 useless extension candidates. Maximal degree in co-relation 3239. Up to 1168 conditions per place. [2022-12-06 05:22:50,401 INFO L137 encePairwiseOnDemand]: 32/34 looper letters, 37 selfloop transitions, 0 changer transitions 31/68 dead transitions. [2022-12-06 05:22:50,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 383 flow [2022-12-06 05:22:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 05:22:50,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 05:22:50,402 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 179 flow. Second operand 3 states and 60 transitions. [2022-12-06 05:22:50,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 383 flow [2022-12-06 05:22:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 372 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:50,408 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 132 flow [2022-12-06 05:22:50,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 05:22:50,410 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 05:22:50,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:50,411 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 132 flow [2022-12-06 05:22:50,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:50,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:50,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 132 flow [2022-12-06 05:22:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 132 flow [2022-12-06 05:22:50,423 INFO L130 PetriNetUnfolder]: 24/78 cut-off events. [2022-12-06 05:22:50,423 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 05:22:50,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 78 events. 24/78 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 89. Up to 28 conditions per place. [2022-12-06 05:22:50,424 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 37 transitions, 132 flow [2022-12-06 05:22:50,424 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:22:50,424 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:50,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:22:50,426 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 132 flow [2022-12-06 05:22:50,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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-06 05:22:50,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:50,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:50,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:22:50,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:50,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2021498286, now seen corresponding path program 1 times [2022-12-06 05:22:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:50,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052766475] [2022-12-06 05:22:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:50,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:50,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052766475] [2022-12-06 05:22:50,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052766475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:50,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:50,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780833693] [2022-12-06 05:22:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:50,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:50,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:50,609 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:50,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 6.5) 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-06 05:22:50,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:50,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:50,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:50,840 INFO L130 PetriNetUnfolder]: 999/1403 cut-off events. [2022-12-06 05:22:50,841 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2022-12-06 05:22:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1403 events. 999/1403 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4506 event pairs, 261 based on Foata normal form. 64/1466 useless extension candidates. Maximal degree in co-relation 3601. Up to 541 conditions per place. [2022-12-06 05:22:50,846 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 65 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-06 05:22:50,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 358 flow [2022-12-06 05:22:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 05:22:50,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:22:50,848 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 132 flow. Second operand 4 states and 66 transitions. [2022-12-06 05:22:50,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 358 flow [2022-12-06 05:22:50,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 344 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:50,850 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 130 flow [2022-12-06 05:22:50,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 05:22:50,852 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 05:22:50,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:50,853 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 130 flow [2022-12-06 05:22:50,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:50,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:50,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 130 flow [2022-12-06 05:22:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 130 flow [2022-12-06 05:22:50,864 INFO L130 PetriNetUnfolder]: 18/76 cut-off events. [2022-12-06 05:22:50,864 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 05:22:50,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 76 events. 18/76 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 1 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 76. Up to 25 conditions per place. [2022-12-06 05:22:50,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 130 flow [2022-12-06 05:22:50,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 05:22:50,866 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:50,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 05:22:50,867 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 130 flow [2022-12-06 05:22:50,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) 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-06 05:22:50,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:50,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:50,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:22:50,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash -336909090, now seen corresponding path program 1 times [2022-12-06 05:22:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:50,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399033681] [2022-12-06 05:22:50,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:51,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:51,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399033681] [2022-12-06 05:22:51,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399033681] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:51,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510652493] [2022-12-06 05:22:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:51,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:51,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:51,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:51,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:22:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:51,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:22:51,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:51,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510652493] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:51,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:51,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 05:22:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685475066] [2022-12-06 05:22:51,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:22:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:22:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:22:51,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:51,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:51,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:51,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:51,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:51,555 INFO L130 PetriNetUnfolder]: 1127/1592 cut-off events. [2022-12-06 05:22:51,555 INFO L131 PetriNetUnfolder]: For 1202/1202 co-relation queries the response was YES. [2022-12-06 05:22:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 1592 events. 1127/1592 cut-off events. For 1202/1202 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5455 event pairs, 277 based on Foata normal form. 1/1589 useless extension candidates. Maximal degree in co-relation 1293. Up to 1205 conditions per place. [2022-12-06 05:22:51,561 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 56 selfloop transitions, 4 changer transitions 3/63 dead transitions. [2022-12-06 05:22:51,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 328 flow [2022-12-06 05:22:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:22:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:22:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 05:22:51,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-06 05:22:51,563 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 130 flow. Second operand 4 states and 61 transitions. [2022-12-06 05:22:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 328 flow [2022-12-06 05:22:51,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:51,565 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 158 flow [2022-12-06 05:22:51,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-06 05:22:51,566 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 05:22:51,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:51,566 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 05:22:51,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:51,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:51,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 05:22:51,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 158 flow [2022-12-06 05:22:51,578 INFO L130 PetriNetUnfolder]: 19/80 cut-off events. [2022-12-06 05:22:51,579 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 05:22:51,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 80 events. 19/80 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 1 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 90. Up to 27 conditions per place. [2022-12-06 05:22:51,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 158 flow [2022-12-06 05:22:51,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 05:22:51,581 WARN L322 ript$VariableManager]: TermVariable LBE356 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,581 WARN L322 ript$VariableManager]: TermVariable LBE774 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,582 WARN L322 ript$VariableManager]: TermVariable LBE344 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,582 WARN L322 ript$VariableManager]: TermVariable LBE376 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,582 WARN L322 ript$VariableManager]: TermVariable LBE839 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:51,582 WARN L322 ript$VariableManager]: TermVariable LBE799 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:22:52,193 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:52,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 628 [2022-12-06 05:22:52,194 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 159 flow [2022-12-06 05:22:52,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:52,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:52,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:52,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:22:52,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 05:22:52,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash 729180131, now seen corresponding path program 1 times [2022-12-06 05:22:52,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:52,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950155252] [2022-12-06 05:22:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:52,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950155252] [2022-12-06 05:22:52,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950155252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:52,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:52,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:22:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003661816] [2022-12-06 05:22:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:52,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:22:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:52,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:22:52,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:22:52,729 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 05:22:52,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 6.5) 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-06 05:22:52,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:52,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 05:22:52,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:52,943 INFO L130 PetriNetUnfolder]: 969/1372 cut-off events. [2022-12-06 05:22:52,943 INFO L131 PetriNetUnfolder]: For 1294/1294 co-relation queries the response was YES. [2022-12-06 05:22:52,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1372 events. 969/1372 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4508 event pairs, 397 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 854. Up to 1158 conditions per place. [2022-12-06 05:22:52,951 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 38 selfloop transitions, 2 changer transitions 9/49 dead transitions. [2022-12-06 05:22:52,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 264 flow [2022-12-06 05:22:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:22:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:22:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 05:22:52,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-06 05:22:52,952 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 159 flow. Second operand 3 states and 47 transitions. [2022-12-06 05:22:52,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 264 flow [2022-12-06 05:22:52,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 256 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 05:22:52,955 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 05:22:52,957 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2022-12-06 05:22:52,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:52,957 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:52,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:52,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,972 INFO L130 PetriNetUnfolder]: 17/74 cut-off events. [2022-12-06 05:22:52,972 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 05:22:52,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 74 events. 17/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 1 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 104. Up to 22 conditions per place. [2022-12-06 05:22:52,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 05:22:52,973 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:52,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:22:52,975 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 134 flow [2022-12-06 05:22:52,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) 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-06 05:22:52,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:52,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:22:52,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:22:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2018565861, now seen corresponding path program 1 times [2022-12-06 05:22:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136746625] [2022-12-06 05:22:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:53,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:53,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136746625] [2022-12-06 05:22:53,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136746625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:53,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928813452] [2022-12-06 05:22:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:53,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:53,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:53,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:53,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:22:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:53,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 05:22:53,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:53,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:22:54,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:54,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:54,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:54,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:22:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:54,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:57,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928813452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:57,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:57,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2022-12-06 05:22:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870726257] [2022-12-06 05:22:57,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:22:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:22:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=406, Unknown=15, NotChecked=0, Total=552 [2022-12-06 05:22:57,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 05:22:57,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 134 flow. Second operand has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:57,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:57,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 05:22:57,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:02,147 INFO L130 PetriNetUnfolder]: 2403/3550 cut-off events. [2022-12-06 05:23:02,147 INFO L131 PetriNetUnfolder]: For 2437/2437 co-relation queries the response was YES. [2022-12-06 05:23:02,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9444 conditions, 3550 events. 2403/3550 cut-off events. For 2437/2437 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16012 event pairs, 522 based on Foata normal form. 3/3536 useless extension candidates. Maximal degree in co-relation 4121. Up to 1436 conditions per place. [2022-12-06 05:23:02,160 INFO L137 encePairwiseOnDemand]: 12/33 looper letters, 131 selfloop transitions, 42 changer transitions 71/244 dead transitions. [2022-12-06 05:23:02,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 244 transitions, 1190 flow [2022-12-06 05:23:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:23:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:23:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 243 transitions. [2022-12-06 05:23:02,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3347107438016529 [2022-12-06 05:23:02,162 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 134 flow. Second operand 22 states and 243 transitions. [2022-12-06 05:23:02,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 244 transitions, 1190 flow [2022-12-06 05:23:02,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 244 transitions, 1178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:23:02,169 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 500 flow [2022-12-06 05:23:02,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=500, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2022-12-06 05:23:02,170 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-06 05:23:02,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:02,170 INFO L89 Accepts]: Start accepts. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 05:23:02,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:02,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:02,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 05:23:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 500 flow [2022-12-06 05:23:02,210 INFO L130 PetriNetUnfolder]: 108/452 cut-off events. [2022-12-06 05:23:02,211 INFO L131 PetriNetUnfolder]: For 324/326 co-relation queries the response was YES. [2022-12-06 05:23:02,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 452 events. 108/452 cut-off events. For 324/326 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2722 event pairs, 47 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1061. Up to 100 conditions per place. [2022-12-06 05:23:02,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 500 flow [2022-12-06 05:23:02,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,144 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,145 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,146 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,146 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,146 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,146 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,146 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:16,147 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:23:32,051 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:23:32,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29881 [2022-12-06 05:23:32,051 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 521 flow [2022-12-06 05:23:32,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:32,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:32,052 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:32,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:23:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:32,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:23:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1760833152, now seen corresponding path program 1 times [2022-12-06 05:23:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110762962] [2022-12-06 05:23:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110762962] [2022-12-06 05:23:32,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110762962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839111839] [2022-12-06 05:23:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:32,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:32,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:23:32,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:23:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:32,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:23:32,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:33,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:34,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:34,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 850 [2022-12-06 05:23:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:39,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839111839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:39,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:39,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:23:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423660329] [2022-12-06 05:23:39,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:39,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:23:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:39,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:23:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:23:39,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:23:39,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 521 flow. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:39,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:39,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:23:39,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:41,166 INFO L130 PetriNetUnfolder]: 3839/5601 cut-off events. [2022-12-06 05:23:41,167 INFO L131 PetriNetUnfolder]: For 11508/11508 co-relation queries the response was YES. [2022-12-06 05:23:41,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19662 conditions, 5601 events. 3839/5601 cut-off events. For 11508/11508 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 26638 event pairs, 642 based on Foata normal form. 360/5960 useless extension candidates. Maximal degree in co-relation 17702. Up to 1469 conditions per place. [2022-12-06 05:23:41,207 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 138 selfloop transitions, 37 changer transitions 35/210 dead transitions. [2022-12-06 05:23:41,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 210 transitions, 1530 flow [2022-12-06 05:23:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:23:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:23:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 176 transitions. [2022-12-06 05:23:41,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37606837606837606 [2022-12-06 05:23:41,209 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 521 flow. Second operand 12 states and 176 transitions. [2022-12-06 05:23:41,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 210 transitions, 1530 flow [2022-12-06 05:23:41,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 210 transitions, 1490 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 05:23:41,223 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 729 flow [2022-12-06 05:23:41,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2022-12-06 05:23:41,224 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2022-12-06 05:23:41,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:41,224 INFO L89 Accepts]: Start accepts. Operand has 88 places, 89 transitions, 729 flow [2022-12-06 05:23:41,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:41,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:41,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 89 transitions, 729 flow [2022-12-06 05:23:41,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 89 transitions, 729 flow [2022-12-06 05:23:41,291 INFO L130 PetriNetUnfolder]: 140/592 cut-off events. [2022-12-06 05:23:41,292 INFO L131 PetriNetUnfolder]: For 776/796 co-relation queries the response was YES. [2022-12-06 05:23:41,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 592 events. 140/592 cut-off events. For 776/796 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3867 event pairs, 58 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1546. Up to 128 conditions per place. [2022-12-06 05:23:41,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 89 transitions, 729 flow [2022-12-06 05:23:41,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 05:23:53,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1659] L110-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork3_#t~nondet14#1=|v_thread2Thread1of1ForFork3_#t~nondet14#1_In_1|} OutVars{thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_Out_4|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_#t~nondet14#1] and [1611] L198-4-->L199-3: Formula: (and (= |v_#pthreadsForks_55| (+ |v_#pthreadsForks_56| 1)) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t4~0#1.base_21|) |v_ULTIMATE.start_main_~#t4~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre49#1_25|)) |v_#memory_int_281|) (= |v_#pthreadsForks_56| |v_ULTIMATE.start_main_#t~pre49#1_25|)) InVars {#pthreadsForks=|v_#pthreadsForks_56|, #memory_int=|v_#memory_int_282|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre49#1=|v_ULTIMATE.start_main_#t~pre49#1_25|, #pthreadsForks=|v_#pthreadsForks_55|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_15|, #memory_int=|v_#memory_int_281|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_21|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_21|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre49#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet48#1, #memory_int, ULTIMATE.start_main_#t~pre47#1] [2022-12-06 05:23:53,993 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:23:53,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12770 [2022-12-06 05:23:53,994 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 752 flow [2022-12-06 05:23:53,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:53,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:53,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:53,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:23:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:54,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:23:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2097075205, now seen corresponding path program 1 times [2022-12-06 05:23:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107170005] [2022-12-06 05:23:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:23:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:54,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107170005] [2022-12-06 05:23:54,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107170005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:54,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:54,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628011016] [2022-12-06 05:23:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:23:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:23:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:23:54,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:23:54,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 752 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:54,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:54,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:23:54,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:55,774 INFO L130 PetriNetUnfolder]: 5292/7965 cut-off events. [2022-12-06 05:23:55,774 INFO L131 PetriNetUnfolder]: For 23346/23346 co-relation queries the response was YES. [2022-12-06 05:23:55,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29529 conditions, 7965 events. 5292/7965 cut-off events. For 23346/23346 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42362 event pairs, 2803 based on Foata normal form. 16/7979 useless extension candidates. Maximal degree in co-relation 28527. Up to 3894 conditions per place. [2022-12-06 05:23:55,818 INFO L137 encePairwiseOnDemand]: 26/42 looper letters, 105 selfloop transitions, 27 changer transitions 25/157 dead transitions. [2022-12-06 05:23:55,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 157 transitions, 1423 flow [2022-12-06 05:23:55,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:23:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:23:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 05:23:55,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:23:55,819 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 752 flow. Second operand 6 states and 105 transitions. [2022-12-06 05:23:55,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 157 transitions, 1423 flow [2022-12-06 05:23:55,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 157 transitions, 1358 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:23:55,883 INFO L231 Difference]: Finished difference. Result has 91 places, 97 transitions, 869 flow [2022-12-06 05:23:55,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=91, PETRI_TRANSITIONS=97} [2022-12-06 05:23:55,884 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-06 05:23:55,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:55,884 INFO L89 Accepts]: Start accepts. Operand has 91 places, 97 transitions, 869 flow [2022-12-06 05:23:55,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:55,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:55,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 97 transitions, 869 flow [2022-12-06 05:23:55,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 869 flow [2022-12-06 05:23:56,008 INFO L130 PetriNetUnfolder]: 209/992 cut-off events. [2022-12-06 05:23:56,008 INFO L131 PetriNetUnfolder]: For 1164/1194 co-relation queries the response was YES. [2022-12-06 05:23:56,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 992 events. 209/992 cut-off events. For 1164/1194 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8032 event pairs, 117 based on Foata normal form. 0/962 useless extension candidates. Maximal degree in co-relation 2542. Up to 240 conditions per place. [2022-12-06 05:23:56,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 97 transitions, 869 flow [2022-12-06 05:23:56,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-06 05:23:56,019 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:23:56,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-06 05:23:56,020 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 869 flow [2022-12-06 05:23:56,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:56,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:56,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:56,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:23:56,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:23:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash 346501392, now seen corresponding path program 1 times [2022-12-06 05:23:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542910621] [2022-12-06 05:23:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:23:56,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:56,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542910621] [2022-12-06 05:23:56,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542910621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:56,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409229383] [2022-12-06 05:23:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:56,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:56,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:23:56,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:23:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:56,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:23:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:23:56,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:57,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:57,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 05:23:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:23:58,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409229383] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:23:58,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:23:58,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-06 05:23:58,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929482418] [2022-12-06 05:23:58,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:23:58,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:23:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:23:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:23:58,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:23:58,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 869 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:23:58,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:58,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:23:58,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:00,521 INFO L130 PetriNetUnfolder]: 8118/12267 cut-off events. [2022-12-06 05:24:00,521 INFO L131 PetriNetUnfolder]: For 38673/38673 co-relation queries the response was YES. [2022-12-06 05:24:00,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44471 conditions, 12267 events. 8118/12267 cut-off events. For 38673/38673 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 70639 event pairs, 3189 based on Foata normal form. 672/12938 useless extension candidates. Maximal degree in co-relation 43532. Up to 2847 conditions per place. [2022-12-06 05:24:00,621 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 181 selfloop transitions, 59 changer transitions 18/258 dead transitions. [2022-12-06 05:24:00,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 258 transitions, 2278 flow [2022-12-06 05:24:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:24:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:24:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 197 transitions. [2022-12-06 05:24:00,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.388560157790927 [2022-12-06 05:24:00,632 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 869 flow. Second operand 13 states and 197 transitions. [2022-12-06 05:24:00,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 258 transitions, 2278 flow [2022-12-06 05:24:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 258 transitions, 2244 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:00,743 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1133 flow [2022-12-06 05:24:00,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1133, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-06 05:24:00,745 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-06 05:24:00,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:00,745 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1133 flow [2022-12-06 05:24:00,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:00,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:00,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1133 flow [2022-12-06 05:24:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 108 transitions, 1133 flow [2022-12-06 05:24:01,013 INFO L130 PetriNetUnfolder]: 262/1373 cut-off events. [2022-12-06 05:24:01,014 INFO L131 PetriNetUnfolder]: For 1941/1993 co-relation queries the response was YES. [2022-12-06 05:24:01,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1373 events. 262/1373 cut-off events. For 1941/1993 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12267 event pairs, 152 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 3578. Up to 326 conditions per place. [2022-12-06 05:24:01,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 108 transitions, 1133 flow [2022-12-06 05:24:01,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 650 [2022-12-06 05:24:01,028 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:01,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 05:24:01,029 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 1133 flow [2022-12-06 05:24:01,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:01,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:01,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:01,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 05:24:01,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 05:24:01,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:24:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1635500227, now seen corresponding path program 1 times [2022-12-06 05:24:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:01,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453428270] [2022-12-06 05:24:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:01,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453428270] [2022-12-06 05:24:01,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453428270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:01,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258580467] [2022-12-06 05:24:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:01,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:01,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:24:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:02,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 05:24:02,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:02,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:02,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:02,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 966 treesize of output 1045 [2022-12-06 05:24:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:04,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258580467] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:04,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:04,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-12-06 05:24:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816648562] [2022-12-06 05:24:04,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:24:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:24:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:24:04,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:24:04,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 1133 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:04,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:04,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:24:04,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:05,809 INFO L130 PetriNetUnfolder]: 7277/11112 cut-off events. [2022-12-06 05:24:05,810 INFO L131 PetriNetUnfolder]: For 34988/34988 co-relation queries the response was YES. [2022-12-06 05:24:05,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40673 conditions, 11112 events. 7277/11112 cut-off events. For 34988/34988 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 63862 event pairs, 3500 based on Foata normal form. 168/11279 useless extension candidates. Maximal degree in co-relation 39934. Up to 4933 conditions per place. [2022-12-06 05:24:05,874 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 78 selfloop transitions, 40 changer transitions 24/142 dead transitions. [2022-12-06 05:24:05,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1425 flow [2022-12-06 05:24:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:24:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:24:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-06 05:24:05,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34798534798534797 [2022-12-06 05:24:05,875 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 1133 flow. Second operand 7 states and 95 transitions. [2022-12-06 05:24:05,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1425 flow [2022-12-06 05:24:05,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 142 transitions, 1377 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 05:24:05,968 INFO L231 Difference]: Finished difference. Result has 102 places, 88 transitions, 934 flow [2022-12-06 05:24:05,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=934, PETRI_PLACES=102, PETRI_TRANSITIONS=88} [2022-12-06 05:24:05,969 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-06 05:24:05,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:05,969 INFO L89 Accepts]: Start accepts. Operand has 102 places, 88 transitions, 934 flow [2022-12-06 05:24:05,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:05,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:05,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 88 transitions, 934 flow [2022-12-06 05:24:05,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 934 flow [2022-12-06 05:24:06,128 INFO L130 PetriNetUnfolder]: 240/1251 cut-off events. [2022-12-06 05:24:06,129 INFO L131 PetriNetUnfolder]: For 1773/1813 co-relation queries the response was YES. [2022-12-06 05:24:06,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1251 events. 240/1251 cut-off events. For 1773/1813 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10879 event pairs, 144 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 3240. Up to 301 conditions per place. [2022-12-06 05:24:06,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 88 transitions, 934 flow [2022-12-06 05:24:06,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-06 05:24:06,144 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:06,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 05:24:06,145 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 934 flow [2022-12-06 05:24:06,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:06,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:06,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:06,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:06,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:24:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1944078593, now seen corresponding path program 1 times [2022-12-06 05:24:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113108390] [2022-12-06 05:24:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113108390] [2022-12-06 05:24:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113108390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646804950] [2022-12-06 05:24:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:08,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:08,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:24:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:08,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 05:24:08,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:08,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:09,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:24:09,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 439 treesize of output 630 [2022-12-06 05:24:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:15,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646804950] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:24:15,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:24:15,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 13 [2022-12-06 05:24:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597064801] [2022-12-06 05:24:15,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:24:15,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:24:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:24:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:24:15,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 05:24:15,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 934 flow. Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:15,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:15,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 05:24:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:17,635 INFO L130 PetriNetUnfolder]: 8442/12922 cut-off events. [2022-12-06 05:24:17,636 INFO L131 PetriNetUnfolder]: For 36474/36474 co-relation queries the response was YES. [2022-12-06 05:24:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46873 conditions, 12922 events. 8442/12922 cut-off events. For 36474/36474 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 77420 event pairs, 2276 based on Foata normal form. 6/12927 useless extension candidates. Maximal degree in co-relation 46709. Up to 4437 conditions per place. [2022-12-06 05:24:17,699 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 110 selfloop transitions, 59 changer transitions 68/237 dead transitions. [2022-12-06 05:24:17,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 237 transitions, 2122 flow [2022-12-06 05:24:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:24:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:24:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2022-12-06 05:24:17,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31794871794871793 [2022-12-06 05:24:17,701 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 934 flow. Second operand 15 states and 186 transitions. [2022-12-06 05:24:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 237 transitions, 2122 flow [2022-12-06 05:24:17,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 237 transitions, 1966 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-12-06 05:24:17,821 INFO L231 Difference]: Finished difference. Result has 105 places, 108 transitions, 1267 flow [2022-12-06 05:24:17,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1267, PETRI_PLACES=105, PETRI_TRANSITIONS=108} [2022-12-06 05:24:17,821 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-06 05:24:17,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:17,822 INFO L89 Accepts]: Start accepts. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 05:24:17,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:17,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:17,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 05:24:17,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 1267 flow [2022-12-06 05:24:17,957 INFO L130 PetriNetUnfolder]: 300/1576 cut-off events. [2022-12-06 05:24:17,957 INFO L131 PetriNetUnfolder]: For 2352/2368 co-relation queries the response was YES. [2022-12-06 05:24:17,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 1576 events. 300/1576 cut-off events. For 2352/2368 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14664 event pairs, 187 based on Foata normal form. 0/1530 useless extension candidates. Maximal degree in co-relation 3870. Up to 386 conditions per place. [2022-12-06 05:24:17,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 1267 flow [2022-12-06 05:24:17,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 668 [2022-12-06 05:24:36,135 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:24:36,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18314 [2022-12-06 05:24:36,135 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 1314 flow [2022-12-06 05:24:36,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:24:36,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:36,136 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:36,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 05:24:36,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:36,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:24:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -515373277, now seen corresponding path program 1 times [2022-12-06 05:24:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:36,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55208370] [2022-12-06 05:24:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55208370] [2022-12-06 05:24:37,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55208370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:24:37,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200013946] [2022-12-06 05:24:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:37,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:24:37,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:24:37,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:24:37,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 05:24:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:24:37,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:24:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:24:37,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:24:39,799 INFO L321 Elim1Store]: treesize reduction 114, result has 69.9 percent of original size [2022-12-06 05:24:39,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1138 treesize of output 1258 [2022-12-06 05:25:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:25:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200013946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:25:06,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:25:06,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-12-06 05:25:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319490719] [2022-12-06 05:25:06,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:25:06,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:25:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:06,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:25:06,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-12-06 05:25:06,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:25:06,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 1314 flow. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:06,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:06,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:25:06,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:08,598 INFO L130 PetriNetUnfolder]: 8238/12656 cut-off events. [2022-12-06 05:25:08,598 INFO L131 PetriNetUnfolder]: For 41806/41806 co-relation queries the response was YES. [2022-12-06 05:25:08,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46161 conditions, 12656 events. 8238/12656 cut-off events. For 41806/41806 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 75836 event pairs, 2508 based on Foata normal form. 112/12768 useless extension candidates. Maximal degree in co-relation 43463. Up to 3738 conditions per place. [2022-12-06 05:25:08,659 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 134 selfloop transitions, 67 changer transitions 90/291 dead transitions. [2022-12-06 05:25:08,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 291 transitions, 2633 flow [2022-12-06 05:25:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:25:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:25:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 240 transitions. [2022-12-06 05:25:08,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 05:25:08,661 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 1314 flow. Second operand 18 states and 240 transitions. [2022-12-06 05:25:08,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 291 transitions, 2633 flow [2022-12-06 05:25:08,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 291 transitions, 2488 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:08,899 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1438 flow [2022-12-06 05:25:08,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1438, PETRI_PLACES=121, PETRI_TRANSITIONS=115} [2022-12-06 05:25:08,899 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-06 05:25:08,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:08,899 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1438 flow [2022-12-06 05:25:08,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:08,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:08,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1438 flow [2022-12-06 05:25:08,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 115 transitions, 1438 flow [2022-12-06 05:25:09,029 INFO L130 PetriNetUnfolder]: 288/1545 cut-off events. [2022-12-06 05:25:09,030 INFO L131 PetriNetUnfolder]: For 2586/2602 co-relation queries the response was YES. [2022-12-06 05:25:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1545 events. 288/1545 cut-off events. For 2586/2602 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14472 event pairs, 187 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 3830. Up to 383 conditions per place. [2022-12-06 05:25:09,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 115 transitions, 1438 flow [2022-12-06 05:25:09,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-06 05:25:09,115 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,115 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,115 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,115 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:09,116 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,738 WARN L322 ript$VariableManager]: TermVariable LBE776 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,738 WARN L322 ript$VariableManager]: TermVariable LBE754 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,738 WARN L322 ript$VariableManager]: TermVariable LBE773 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE154 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE131 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE815 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE841 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE166 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,739 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE746 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE843 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE808 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:12,740 WARN L322 ript$VariableManager]: TermVariable LBE807 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:25:17,102 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:25:17,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8203 [2022-12-06 05:25:17,103 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 1442 flow [2022-12-06 05:25:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:17,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:17,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:17,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:25:17,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:25:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1794381854, now seen corresponding path program 1 times [2022-12-06 05:25:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:17,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289930020] [2022-12-06 05:25:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:25:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289930020] [2022-12-06 05:25:17,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289930020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933375001] [2022-12-06 05:25:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:17,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:17,797 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:17,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 05:25:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:17,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 05:25:17,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:25:18,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:25:18,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933375001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:18,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:25:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 05:25:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530802411] [2022-12-06 05:25:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:18,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:25:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:18,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:25:18,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:25:18,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:25:18,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:18,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:18,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:25:18,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:19,609 INFO L130 PetriNetUnfolder]: 8952/13735 cut-off events. [2022-12-06 05:25:19,610 INFO L131 PetriNetUnfolder]: For 52072/52072 co-relation queries the response was YES. [2022-12-06 05:25:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50757 conditions, 13735 events. 8952/13735 cut-off events. For 52072/52072 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 84277 event pairs, 7556 based on Foata normal form. 144/13878 useless extension candidates. Maximal degree in co-relation 47976. Up to 11689 conditions per place. [2022-12-06 05:25:19,683 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 133 selfloop transitions, 9 changer transitions 4/146 dead transitions. [2022-12-06 05:25:19,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 146 transitions, 1959 flow [2022-12-06 05:25:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:25:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:25:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 05:25:19,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2022-12-06 05:25:19,684 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 1442 flow. Second operand 3 states and 73 transitions. [2022-12-06 05:25:19,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 146 transitions, 1959 flow [2022-12-06 05:25:19,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 146 transitions, 1773 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-06 05:25:19,884 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 1246 flow [2022-12-06 05:25:19,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1246, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2022-12-06 05:25:19,884 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-06 05:25:19,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:19,884 INFO L89 Accepts]: Start accepts. Operand has 108 places, 110 transitions, 1246 flow [2022-12-06 05:25:19,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:19,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:19,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 1246 flow [2022-12-06 05:25:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 110 transitions, 1246 flow [2022-12-06 05:25:20,021 INFO L130 PetriNetUnfolder]: 290/1555 cut-off events. [2022-12-06 05:25:20,022 INFO L131 PetriNetUnfolder]: For 2206/2222 co-relation queries the response was YES. [2022-12-06 05:25:20,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4098 conditions, 1555 events. 290/1555 cut-off events. For 2206/2222 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14516 event pairs, 181 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 3780. Up to 376 conditions per place. [2022-12-06 05:25:20,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 110 transitions, 1246 flow [2022-12-06 05:25:20,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-06 05:25:20,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:20,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-06 05:25:20,038 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 1246 flow [2022-12-06 05:25:20,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:25:20,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:20,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:20,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 05:25:20,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:25:20,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 05:25:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash -682394318, now seen corresponding path program 1 times [2022-12-06 05:25:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:20,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850871570] [2022-12-06 05:25:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:21,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850871570] [2022-12-06 05:25:21,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850871570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:25:21,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371256682] [2022-12-06 05:25:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:25:21,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:25:21,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:25:21,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 05:25:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:21,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 05:25:21,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:25:21,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:25:21,850 INFO L321 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2022-12-06 05:25:21,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 104 [2022-12-06 05:25:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:25:21,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:25:23,581 INFO L321 Elim1Store]: treesize reduction 240, result has 70.0 percent of original size [2022-12-06 05:25:23,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1907 treesize of output 2258 Received shutdown request... [2022-12-06 05:36:34,324 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:36:34,324 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:36:34,325 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:36:34,327 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 05:36:34,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 05:36:34,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:36:34,529 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. [2022-12-06 05:36:34,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 05:36:34,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 05:36:34,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 05:36:34,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 05:36:34,531 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:34,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:36:34,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:36:34,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:36:34 BasicIcfg [2022-12-06 05:36:34,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:36:34,535 INFO L158 Benchmark]: Toolchain (without parser) took 846955.87ms. Allocated memory was 210.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 186.7MB in the beginning and 562.1MB in the end (delta: -375.4MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 210.8MB. Free memory is still 188.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.71ms. Allocated memory is still 210.8MB. Free memory was 186.7MB in the beginning and 169.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.37ms. Allocated memory is still 210.8MB. Free memory was 169.6MB in the beginning and 166.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: Boogie Preprocessor took 44.73ms. Allocated memory is still 210.8MB. Free memory was 166.4MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: RCFGBuilder took 1016.57ms. Allocated memory is still 210.8MB. Free memory was 163.8MB in the beginning and 99.8MB in the end (delta: 64.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-12-06 05:36:34,536 INFO L158 Benchmark]: TraceAbstraction took 845554.56ms. Allocated memory was 210.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 98.8MB in the beginning and 562.1MB in the end (delta: -463.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-06 05:36:34,537 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.16ms. Allocated memory is still 210.8MB. Free memory is still 188.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.71ms. Allocated memory is still 210.8MB. Free memory was 186.7MB in the beginning and 169.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.37ms. Allocated memory is still 210.8MB. Free memory was 169.6MB in the beginning and 166.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.73ms. Allocated memory is still 210.8MB. Free memory was 166.4MB in the beginning and 163.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1016.57ms. Allocated memory is still 210.8MB. Free memory was 163.8MB in the beginning and 99.8MB in the end (delta: 64.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * TraceAbstraction took 845554.56ms. Allocated memory was 210.8MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 98.8MB in the beginning and 562.1MB in the end (delta: -463.3MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 291 PlacesBefore, 38 PlacesAfterwards, 315 TransitionsBefore, 33 TransitionsAfterwards, 5184 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 196 TrivialYvCompositions, 57 ConcurrentYvCompositions, 21 ChoiceCompositions, 274 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 3610, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3610, independent: 3610, independent conditional: 0, independent unconditional: 3610, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 2419, independent: 2419, independent conditional: 0, independent unconditional: 2419, 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: 3610, independent: 1191, independent conditional: 0, independent unconditional: 1191, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 0, Positive unconditional cache size: 4536, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 39 PlacesBefore, 39 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 20, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.8s, 74 PlacesBefore, 72 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 28, Positive conditional cache size: 28, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7s, 87 PlacesBefore, 87 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.2s, 105 PlacesBefore, 105 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 119 PlacesBefore, 118 PlacesAfterwards, 115 TransitionsBefore, 114 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 37ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 347 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: 845.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.1s, HoareTripleCheckerStatistics: 91 mSolverCounterUnknown, 2583 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2583 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3386 IncrementalHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 0 mSDtfsCounter, 3386 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1442occurred in iteration=15, InterpolantAutomatonStates: 125, 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.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 799 ConstructedInterpolants, 22 QuantifiedInterpolants, 14601 SizeOfPredicates, 379 NumberOfNonLiveVariables, 3537 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 32 InterpolantComputations, 9 PerfectInterpolantSequences, 43/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown